Average distance and maximum induced forest

DOI10.1002/JGT.20344zbMATH Open1182.05049OpenAlexW2599540576MaRDI QIDQ3605159FDOQ3605159

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

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

zbMATH Keywords

independence numberinduced forestaverage distanceinduced bipartite subgraph

Mathematics Subject Classification ID

Distance in graphs (05C12)

Cites Work

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

Cited In (13)

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

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)