Bounds on co-independent liar's domination in graphs

DOI10.1155/2021/5544559MaRDI QIDQ2034485zbMATH OpenOpenAlexFDO

Authors K. Suriya Prabha, S. Amutha, N. Anbazhagan, Ismail Naci Cangül

Publication date 22 June 2021

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

Copyright license Creative Commons Attribution 4.0 International

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)

Recommendations

• Liar's domination in graphs
• Liar's dominating sets in graphs
• Liar's domination in graphs under some operations
• Various bounds for liar's domination number
• scientific article; zbMATH DE number 5972305

Cites work

• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• Characterization of total very excellent trees
• Induced subgraphs of gamma graphs
• Liar's domination in graphs
• Liar's domination in graphs: complexity and algorithm
• Minimizing Kirchhoff index among graphs with a given vertex bipartiteness
• On topological indices for new classes of Benes network
• Various bounds for liar's domination number
• \(\gamma_t\)-graph of a graph \(G\)

Cited in

(2)

• On the total liar's domination of graphs
• Connected liar's domination in graphs: complexity and algorithms

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

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