Reinforcement number of a graph with respect to half-domination

DOI10.1155/2021/6689816zbMath1477.05137OpenAlexW3155228432MaRDI QIDQ2035727

G. Muhiuddin, S. Amutha, M. E. Elnair, Deena Al-Kadi, N. S. Sridharan

Publication date: 25 June 2021

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

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

Mathematics Subject Classification ID

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

Related Items (3)

Certain concepts of interval-valued intuitionistic fuzzy graphs with an application ⋮ A novel study of graphs based on \(m\)-polar cubic structures ⋮ New perspectives on classical meanness of some ladder graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of reinforcement in graphs
• A mathematical approach on representation of competitions: competition cluster hypergraphs
• Total Roman reinforcement in graphs
• Total reinforcement number of a graph
• INDUCED SUBGRAPHS OF GAMMA GRAPHS
• The cobondage number of a graph
• Neighborhood outer split domination in graphs
• Total Roman domination in graphs
• A textbook of graph theory

This page was built for publication: Reinforcement number of a graph with respect to half-domination