On the broadcast domination number of permutation graphs

DOI10.1016/j.tcs.2019.03.025zbMath1442.05053OpenAlexW2929706675WikidataQ128159115 ScholiaQ128159115MaRDI QIDQ2285130

Eunjeong Yi

Publication date: 16 January 2020

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2019.03.025

zbMATH Keywords

pathscyclesdistancegeneralized prismcomplete multipartite graphsbroadcast dominationpermutation graph

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Paths and cycles (05C38) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distance 2-domination in prisms of graphs
• Optimal broadcast domination in polynomial time
• Relations between packing and covering numbers of a tree
• Broadcasts in graphs
• On diameter of permutation graphs
• Domination in functigraphs
• On restricted connectivities of permutation graphs

This page was built for publication: On the broadcast domination number of permutation graphs