Matchings and total domination subdivision number in graphs with few induced 4-cycles

DOI10.7151/DMGT.1517MaRDI QIDQ2997587zbMATH OpenOpenAlexFDO

Authors Odile Favaron, Hossein Karami, R. Khoeilar, Seyed Mahmood Sheikholeslami

Publication date 9 May 2011

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/e2d6c19c6de6277072f87760cc726c119e13fa94

zbMATH Keywords

matchingtotal domination numberbarriertotal domination subdivision number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• The total domination subdivision number in graphs with no induced 3-cycle and 5-cycle
• On two conjectures concerning total domination subdivision number in graphs
• On the total domination subdivision number in graphs
• On the total domination subdivision numbers in graphs
• On a conjecture concerning total domination subdivision number in graphs

Cited in

(7)

• Totally odd \(K_4\)-subdivisions in 4-chromatic graphs
• THE NUMBER OF DISTINCT 4-CYCLES AND 2-MATCHINGS OF SOME ZERO-DIVISOR GRAPHS
• Total domination and matching numbers in graphs with all vertices in triangles
• The total domination subdivision number in graphs with no induced 3-cycle and 5-cycle
• On the total domination subdivision numbers in graphs
• On a conjecture concerning total domination subdivision number in graphs
• On two conjectures concerning total domination subdivision number in graphs

This page was built for publication: Matchings and total domination subdivision number in graphs with few induced 4-cycles

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