scientific article
From MaRDI portal
Publication:3781134
zbMath0639.05040MaRDI QIDQ3781134
Siemion Fajtlowicz, William A. Waller
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Average distance and independence number ⋮ Wiener index in graphs with given minimum degree and maximum degree ⋮ Computing the average distance of an interval graph ⋮ An upper bound on the diameter of a 3-edge-connected \(C_4\)-free graph ⋮ Counting the Numbers of Paths of All Lengths in Symmetric Dendrimers and Its Applications ⋮ Independence and average distance in graphs ⋮ A computational attack on the conjectures of Graffiti: New counterexamples and proofs ⋮ Average distance and domination number ⋮ ON THE TOTAL DISTANCE AND DIAMETER OF GRAPHS ⋮ On maximum Wiener index of trees and graphs with given radius ⋮ A characterization of graphs where the independence number equals the radius ⋮ The extremal average distance of cubic graphs ⋮ Average distance, minimum degree, and irregularity index ⋮ Comparing eccentricity-based graph invariants ⋮ Average distance and connected domination ⋮ The average distance and the independence number ⋮ A proof of two conjectures on the Randić index and the average eccentricity ⋮ Facet defining inequalities among graph invariants: The system graphedron ⋮ The connective eccentricity index and modified second Zagreb index of Parikh word representable graphs ⋮ Diameter and inverse degree ⋮ Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number ⋮ Average distance and generalised packing in graphs ⋮ Minimum size of a graph or digraph of given radius ⋮ Mean distance in a tree ⋮ A note on dominating sets and average distance ⋮ Average Distance, Independence Number, and Spanning Trees ⋮ Computer based proofs by induction in graph theory - A house of cards?
Uses Software
This page was built for publication:
