Every γ-excellent, γ-flexible graph is γbi-excellent

DOI10.1080/09720529.2004.10697992MaRDI QIDQ4821806zbMATH OpenOpenAlexFDO

Authors M. Yamuna, N. Sridharan

Publication date 21 October 2004

Published in Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/09720529.2004.10697992

zbMATH Keywords

\(\gamma\)-excellent graph\(\gamma\)-flexible graph\(\gamma_{\text{bi}}\)-excellentbridge independent domination

Mathematics Subject Classification ID

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

Recommendations

• Excellent graphs with respect to domination: subgraphs induced by minimum dominating sets
• A note on excellent graphs.
• scientific article; zbMATH DE number 2028642
• Very excellent graphs and rigid very excellent graphs
• -graphs of graphs

Cited in

(3)

• Very excellent graphs and rigid very excellent graphs
• Characterization of total very excellent trees
• Excellent graphs with respect to domination: subgraphs induced by minimum dominating sets

This page was built for publication: Every γ-excellent, γ-flexible graph is γ_bi-excellent

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