Article

# On a Vizing-like conjecture for direct product graphs.

• ##### Sandi Klavzar
Department of Mathematics, PEF, University of Maribor, Koroška cesta 160, 2000 Maribor, Slovenia
Discrete Mathematics (Impact Factor: 0.58). 01/1996; 156:243-246. DOI: 10.1016/0012-365X(96)00032-5
Source: DBLP

ABSTRACT Let fl(G) be the domination number of a graph G, and let G \Theta H be thedirect product of graphs G and H . It is shown that for any k 0 there existsa graph G such that fl(G \Theta G) fl(G)

0 Bookmarks
·
40 Views
• Source
##### Article: Dominating direct products of graphs
[Hide abstract]
ABSTRACT: An upper bound for the domination number of the direct product of graphs is proved. It in particular implies that for any graphs G and H, γ(G×H)⩽3γ(G)γ(H). Graphs with arbitrarily large domination numbers are constructed for which this bound is attained. Concerning the upper domination number we prove that Γ(G×H)⩾Γ(G)Γ(H), thus confirming a conjecture from [R. Nowakowski, D.F. Rall, Associative graph products and their independence, domination and coloring numbers, Discuss. Math. Graph Theory 16 (1996) 53–79]. Finally, for paired-domination of direct products we prove that γpr(G×H)⩽γpr(G)γpr(H) for arbitrary graphs G and H, and also present some infinite families of graphs that attain this bound.
Discrete Mathematics 01/2007; · 0.58 Impact Factor
• ##### Article: Lower bounds for the domination number and the total domination number of direct product graphs
[Hide abstract]
ABSTRACT: A sharp lower bound for the domination number and the total domination number of the direct product of finitely many complete graphs is given: γ(×i=1tKni)≥t+1,t≥3. Sharpness is established in the case when the factors are large enough in comparison to the number of factors. The main result gives a lower bound for the domination (and the total domination) number of the direct product of two arbitrary graphs: γ(G×H)≥γ(G)+γ(H)−1γ(G×H)≥γ(G)+γ(H)−1. Infinite families of graphs that attain the bound are presented. For these graphs it also holds that γt(G×H)=γ(G)+γ(H)−1γt(G×H)=γ(G)+γ(H)−1. Some additional parallels with the total domination number are made.
Discrete Mathematics 12/2010; 310(23):3310–3317. · 0.58 Impact Factor
• Source
##### Article: Domination Number of the Cross Product of Paths.
[Hide abstract]
ABSTRACT: The problem of determining the domination number of an arbitrary grid graph is known to be NP-complete, but the complexity of the same problem on complete grid graphs is still unknown. In the present paper we study the same problem on a similar grid graph defined by the cross product of two paths pk and Pn.
Discrete Applied Mathematics 01/1999; 94:101-139. · 0.72 Impact Factor

1 Download
Available from