Porous exponential domination in Harary graphs

DOI10.1134/S0001434620010228zbMath1442.05150OpenAlexW3009648418WikidataQ115526135 ScholiaQ115526135MaRDI QIDQ2191954

C. Çiftçi, Aysun Aytaç

Publication date: 26 June 2020

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0001434620010228

zbMATH Keywords

Harary graphporous exponential domination

Mathematics Subject Classification ID

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

Related Items

Porous exponential domination number of some graphs ⋮ A vulnerability parameter of networks

Uses Software

• Mathematica

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Disjunctive total domination in graphs
• Exponential domination in subcubic graphs
• On exponential domination of \(C_m\times C_n\)
• Bounds on the exponential domination number
• Domination with exponential decay
• Relating domination, exponential domination, and porous exponential domination
• THE MAXIMUM CONNECTIVITY OF A GRAPH

This page was built for publication: Porous exponential domination in Harary graphs