Coalescence and criticality of graphs

DOI10.1016/j.disc.2013.01.027zbMath1261.05076OpenAlexW2083300595MaRDI QIDQ1945953

Yanyan Li

Publication date: 17 April 2013

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

Full work available at URL: https://doi.org/10.1016/j.disc.2013.01.027

zbMATH Keywords

coalescencevertex-criticaldominating setdomination numberirredundance number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

Bicritical domination and double coalescence of graphs ⋮ Unnamed Item ⋮ Irredundance

Cites Work

• Unnamed Item
• Unnamed Item
• The irredundance number and maximum degree of a graph
• Bicritical domination
• Vertex domination-critical graphs
• Properties of Hereditary Hypergraphs and Middle Graphs

This page was built for publication: Coalescence and criticality of graphs