Note on the domination number of graphs with forbidden cycles of lengths not divisible by 3

MaRDI QIDQ5863477zbMATH OpenFDO

Authors Mustapha Chellali, R. Khoeilar, Hossein Karami, Seyed Mahmood Sheikholeslami

Publication date 1 June 2022

Full work available at URL http://ajc.maths.uq.edu.au/pdf/83/ajc_v83_p101.pdf

zbMATH Keywords

domination numbertailed-cycletriangular vertex

Mathematics Subject Classification ID

Distance in graphs (05C12) Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Domination number of graphs without small cycles
• Domination in bipartite graphs
• Long dominating cycles in graphs
• On the domination number of graphs with minimum degree six
• A note on domination, girth and minimum degree

Cites work

• A new bound on the domination number of graphs with minimum degree two
• Dominating sets for split and bipartite graphs
• Domination in bipartite graphs
• Domination in graphs with minimum degree two
• Domination number in graphs with minimum degree two
• scientific article; zbMATH DE number 3172309 (Why is no real title available?)
• Paths, Stars and the Number Three

Cited in

(3)

• On equality in an upper bound for the restrained and total domination numbers of a graph
• Domination number of graphs without small cycles
• Domination in bipartite graphs

This page was built for publication: Note on the domination number of graphs with forbidden cycles of lengths not divisible by 3

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5863477)