On -excellent graphs

DOI10.1007/S40840-022-01456-0OpenAlexW4316469491MaRDI QIDQ2683166FDOQ2683166

Authors: Michael A. Henning, Jerzy Topp, Magda Dettlaff 

Publication date: 3 February 2023

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2208.08498

Recommendations

• \(\beta _{0}\)-excellent graphs
• \(\beta_0\)-excellent graphs
• Very excellent graphs and rigid very excellent graphs
• A note on excellent graphs.
• A characterization of \(i\)-excellent trees

zbMATH Keywords

independence numberindependent domination numberexcellent graph

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• WELL-COVERED GRAPHS: A SURVEY
• Some covering concepts in graphs
• On simple characterizations of k-trees
• Independent domination in graphs: A survey and recent results
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Well covered simplicial, chordal, and circular arc graphs
• On domination and independence numbers of graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• On weakly connected domination in graphs. II.
• Title not available (Why is that?)
• Title not available (Why is that?)
• \(\beta_0\)-excellent graphs

Cited In (3)

• On $\alpha$-excellent graphs
• \(\beta_0\)-excellent graphs
• \(\beta _{0}\)-excellent graphs

This page was built for publication: On \(\alpha\)-excellent graphs

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