Bounds on co-independent liar's domination in graphs

DOI10.1155/2021/5544559zbMATH Open1477.05138OpenAlexW3138990490MaRDI QIDQ2034485FDOQ2034485

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)

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

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Liar's domination in graphs: complexity and algorithm
• Title not available (Why is that?)
• Various bounds for liar's domination number
• Minimizing Kirchhoff index among graphs with a given vertex bipartiteness
• Characterization of Total Very Excellent Trees
• On topological indices for new classes of Benes network
• Induced subgraphs of gamma graphs
• \(\gamma_t\)-graph of a graph \(G\)

Cited In (2)

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

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)