Please use this identifier to cite or link to this item:
|Title:||Equality in Vizing’s conjecture fixing one factor of the Cartesian product.|
|Keywords:||Domination number, Cartesian product, Vizing’s conjecture|
Domination number, Cartesian product, Vizing’s conjecture.
|Citation:||Ars combinatoria Vol. (96) July, 2010. 375–384.|
|Abstract:||In this paper, we investigate the existence of nontrivial solutions for the equation γ(G□H) = γ(G) γ(H) fixing one factor. For the complete bipartite graphs Km,n; we characterize all nontrivial solutions when m = 2, n ≥ 3and prove the nonexistence of solutions when m, n ≥ 3. In addition, it is proved that the above equation has no nontrivial solution if H is one of the graphs obtained from Cn, the cycle of length n, either by adding a vertex and one pendant edge joining this vertex to any v V(Cn), or by adding one chord joining two alternating vertices of Cn (17) (PDF) Equality in Vizing's Conjecture Fixing One Factor of the Cartesian Product. Available from: https://www.researchgate.net/publication/266540982_Equality_in_Vizing's_Conjecture_Fixing_One_Factor_of_the_Cartesian_Product [accessed Jan 23 2019].|
|Appears in Collections:||Applied science faculty|
Files in This Item:
|Ars.Comb.Equality_in_Vizings_conjecture.pdf||Main article||258.84 kB||Adobe PDF|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.