Average distance and maximum induced forest

DOI10.1002/JGT.20344MaRDI QIDQ3605159zbMATH OpenOpenAlexFDO

Authors Pierre Hansen, Alain Hertz, Rim Kilani, Odile Marcotte, David Schindl

Publication date 20 February 2009

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.20344

zbMATH Keywords

independence numberinduced forestaverage distanceinduced bipartite subgraph

Mathematics Subject Classification ID

Distance in graphs (05C12)

Recommendations

• Spanning trees with many leaves and average distance
• scientific article; zbMATH DE number 805123
• On mean distance and girth
• Average distance, independence number, and spanning trees
• scientific article; zbMATH DE number 508964

Cites work

• Average distance and independence number
• The average distance and the independence number
• Variable neighborhood search for extremal graphs. I: The AutoGraphiX system

Cited in

(13)

• scientific article; zbMATH DE number 1416060 (Why is no real title available?)
• Induced forests in some distance-regular graphs
• Average distance and domination number revisited
• Average distance and connected domination
• Spanning trees with many leaves and average distance
• A note on the average distance of a graph
• MIP formulations for induced graph optimization problems: a tutorial
• Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited
• scientific article; zbMATH DE number 508964 (Why is no real title available?)
• Average distance and independence number
• Some results about the inset edge and average distance of trees
• A note on dominating sets and average distance
• Tree-minimal graphs are almost regular

Describes a project that uses

Uses Software

• AutoGraphiX
• GRAFFITI

This page was built for publication: Average distance and maximum induced forest

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