Bounds on co-independent liar's domination in graphs

DOI10.1155/2021/5544559zbMath1477.05138OpenAlexW3138990490MaRDI QIDQ2034485

K. Suriya Prabha, S. Amutha, N. Anbazhagan, Ismail Naci Cangul

Publication date: 22 June 2021

Published in: Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2021/5544559

Mathematics Subject Classification ID

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

Cites Work

• Various bounds for liar's domination number
• Minimizing Kirchhoff index among graphs with a given vertex bipartiteness
• Liar's domination in graphs: complexity and algorithm
• On topological indices for new classes of Benes network
• INDUCED SUBGRAPHS OF GAMMA GRAPHS
• Characterization of Total Very Excellent Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bounds on co-independent liar's domination in graphs