No Detail Found!

Domination number and traceability of graphs

Author(s)
Rao Li Department of Mathematical Sciences, University of South Carolina Aiken,Aiken, SC 29801,USA
Abstract
For k ≥ 1, let G be a k-connected graph of order n. In this note, it is proved that if γ(G c ) ≥ n − k − 1 then G is either traceable or Kk ∨ Kc k+2, where γ(G c ) is the domination number of the complement of the graph G and Kk ∨ Kc k+2 is the join of Kk and Kc k+2.
Publication Details
Page(s) 27-30
DOI DOI not available
Published Journal: Discrete Mathematics Letters, Volume: 4, Issue: 0, Year: 2020

Request the full text from PASTIC

Keywords
Traceability, domination number
References
Amar D.,I. Fournier D.,Germa A.,Ha R. .1984 .¨ggkvist, Covering of vertices of a simple graph with given connectivity and stability number. , 20 : 43-45.
Bondy J. A.,Murty U. S. R. .1976 .. Graph Theory with Applications, : .
Gernert D. .1989 .Inequalities between the domination number and the chromatic number of a graph. Discrete Math, 76 : 151-153.
Li R. . .Domination number. J. Combin. Math. Combin. Comput., Accepted., : .
0

Citations

0

Downloads

20

Views