Strong Domination number of Hajós sum and vertex-sum of two graphs

DOI10.22190/fumi230720032gMaRDI QIDQ6620644

Saeid Alikhani, N. Ghanbari

Publication date: 17 October 2024

Published in: Facta Universitatis. Series Mathematics and Informatics (Search for Journal in Brave)

zbMATH Keywords

graphstrong domination numberHajós sum

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Characterization of graphs using domination polynomials
• Strong weak domination and domination balance in a graph
• Computation of minimal rank and path cover number for certain graphs
• Bounds on the strong domination number
• A note on a relation between the weak and strong domination numbers of a graph
• Introduction to Domination Polynomial of a Graph

This page was built for publication: Strong Domination number of Hajós sum and vertex-sum of two graphs

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