Hamiltonicity of 3tEC Graphs with α=κ+1

Huanying He, Xinhui An, Zongjun Zhao and Elena Guardo

Journal of Mathematics, 2021, vol. 2021, 1-5

Abstract: A set S of vertices in a graph G is a total dominating set of G if every vertex of G is adjacent to some vertex in S. The minimum cardinality of a total dominating set of G is the total domination number γtG of G. The graph G is total domination edge-critical, or γtEC, if for every edge e in the complement of G, γtG+e

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2021/5523761.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2021/5523761.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jjmath:5523761

DOI: 10.1155/2021/5523761

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().