Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

24

JCT
2010

favoriteEmaildiscussreport

95views more JCT 2010»

Oriented diameter of graphs with diameter 3

13 years 9 months ago

Oriented diameter of graphs with diameter 3

Download www.math.uiuc.edu

In 1978, Chv´atal and Thomassen proved that every 2-edge-connected graph with diameter 2 has an orientation with diameter at most 6. They also gave general bounds on the smallest value f(d) such that every 2-edge-connected graph G with diameter d has an orientation with diameter at most f(d). For d = 3, their general bounds reduce

Peter K. Kwok, Qi Liu, Douglas B. West

Real-time Traffic

2-edge-connected Graph | General Bounds | JCT 2010 |

claim paper

Related Content

» Diameter and connectivity of 3arc graphs

» Almost Minimum Diameter Orientations of Semicomplete Multipartite and Extended Digraphs

» Separating systems and oriented graphs of diameter two

» Lower connectivities of regular graphs with small diameter

» Maximum pebbling number of graphs of diameter three

» QuasiSpectral Characterization of Strongly DistanceRegular Graphs

» Superconnected digraphs and graphs with small conditional diameters

» High Degree Vertices Eigenvalues and Diameter of Random Apollonian Networks

» FISSIONE a scalable constant degree and low congestion DHT scheme based on Kautz graphs

Post Info
More Details (n/a)

Added	28 Jan 2011
Updated	28 Jan 2011
Type	Journal
Year	2010
Where	JCT
Authors	Peter K. Kwok, Qi Liu, Douglas B. West

Comments (0)