Signed domination in Kronecker product of two complete graphs

Authors

  • Zhao, Yancai
  • Shan, Erfang
  • Miao, Lianying

Abstract

Given two graphs G1 and G2. The Kronecker product G1 ⊗ G2 of G1 and G2 is the graph which has vertex set V(G1 ⊗ G2) = V(G1) x V(G2) and edge set (Equation). In this paper, we determine the exact value of signed domination number of Km ⊗ Kn as a main result, and provide the exact values of minus domination number and paired domination number of Km⊗Kn.

Published

2013-06-09

How to Cite

Zhao, Yancai, Shan, Erfang, & Miao, Lianying. (2013). Signed domination in Kronecker product of two complete graphs. Utilitas Mathematica, 91. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/973

Issue

Section

Articles

Citation Check

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.