Independence and average distance in graphs

DOI10.1016/S0166-218X(96)00078-9zbMath0880.05030OpenAlexW2088389361WikidataQ126789360 ScholiaQ126789360MaRDI QIDQ1363759

Julie Haviland, P. A. Firby

Publication date: 19 January 1998

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

distanceindependence number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12)

Related Items

A new approach on locally checkable problems ⋮ Sharp upper bounds on the \(k\)-independence number in graphs with given minimum and maximum degree ⋮ The optimal bound on the 3-independence number obtainable from a polynomial-type method ⋮ A new class of polynomials from the spectrum of a graph, and its application to bound the \(k\)-independence number ⋮ On inertia and ratio type bounds for the \(k\)-independence number of a graph and their relationship ⋮ Spectral bounds for the \(k\)-independence number of a graph ⋮ The \(k\)-independence number of \(t\)-connected graphs ⋮ Spectral upper bound on the quantum k-independence number of a graph ⋮ Average distance and generalised packing in graphs ⋮ Optimization of eigenvalue bounds for the independence and chromatic number of graph powers ⋮ Average distances and distance domination numbers ⋮ On the \(k\)-independence number of graphs ⋮ Unnamed Item

Uses Software

• GRAFFITI

Cites Work

• Unnamed Item
• Unnamed Item
• Mean distance in a graph
• Average distance and independence number
• On the sum of all distances in a graph or digraph
• Existence of graphs with prescribed mean distance
• The average distance and the independence number
• Distance in graphs
• Maximal Spacing Configurations in Graphs

This page was built for publication: Independence and average distance in graphs