Graphs whose vertex independence number is unaffected by single edge addition or deletion
From MaRDI portal
Publication:689974
DOI10.1016/0166-218X(93)90026-KzbMath0792.05116MaRDI QIDQ689974
Douglas F. Rall, Bert L. Hartnell, Georg Gunther
Publication date: 24 July 1994
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
trees; addition; dominating set; vertex independence number; deletion; constructive characterization
05C05: Trees
05C35: Extremal problems in graph theory
05C75: Structural characterization of families of graphs
Related Items
Extremal graphs domination insensitive to the removal of \(k\) edges, The structure and maximum number of maximum independent sets in trees
Cites Work