Maximum Degree Growth of the Iterated Line Graph

13 years 4 months ago

Download www.combinatorics.org

Let k denote the maximum degree of the kth iterated line graph Lk(G). For any connected graph G that is not a path, the inequality k+1 2k - 2 holds. Niepel, Knor, and Solt

Stephen G. Hartke, Aparna W. Higgins

Real-time Traffic

COMBINATORICS 1999 | Connected Graph | Line Graph | Maximum Degree |

claim paper

» BoundedDegree Graphs have Arbitrarily Large Geometric Thickness

» On Stable Cutsets in ClawFree Graphs and Planar Graphs

» Maximum causal entropy correlated equilibria for Markov games

» Orthogonal Drawings of Plane Graphs without Bends

» VBS Maximum Lifetime Sleep Scheduling for Wireless Sensor Networks Using Virtual Backbones

» A Dynamic Model for OnLine Social Networks

» Dynamics Criticality and SelfOrganization in a Model for Blackouts in Power Transmission S...

» On Bus Graph Realizability

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	1999
Where	COMBINATORICS
Authors	Stephen G. Hartke, Aparna W. Higgins

Comments (0)

Sciweavers

Maximum Degree Growth of the Iterated Line Graph

COMBINATORICS 1999 | Connected Graph | Line Graph | Maximum Degree |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers