On average lower independence and domination numbers in graphs

DOI10.1016/j.disc.2004.12.006zbMath1066.05099OpenAlexW2155628394MaRDI QIDQ556830

Mustapha Chellali, Frédéric Maffray, Mostafa Blidia

Publication date: 23 June 2005

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

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

zbMATH Keywords

extremal graphs

Mathematics Subject Classification ID

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

Related Items (5)

VERTEX VULNERABILITY PARAMETER OF GEAR GRAPHS ⋮ The vulnerability of some networks including cycles via domination parameters ⋮ The average lower reinforcement number of a graph ⋮ On the average lower bondage number of a graph ⋮ On average lower independence and domination numbers in graphs

Cites Work

• On average lower independence and domination numbers in graphs
• Relations between parameters of a graph
• On graphs having domination number half their order
• Independent domination and matchings in graphs
• Extremal graphs for a new upper bound on domination parameters in graphs
• Domination-balanced graphs
• Paths, Trees, and Flowers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On average lower independence and domination numbers in graphs