✦ LIBER ✦

On the Diameter of Wenger Graphs

✍ Scribed by Raymond Viglione

Book ID: 106334817
Publisher: Springer Netherlands
Year: 2008
Tongue: English
Weight: 195 KB
Volume: 104
Category: Article
ISSN: 0167-8019
DOI: 10.1007/s10440-008-9249-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On diameter critical graphs

✍ Louis Caccetta; Roland Häggkvist 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 520 KB

On diameter of permutation graphs

✍ Gu, Weizhen 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 109 KB 👁 2 views

Let G be a connected graph with n vertices. Let a be a permutation in S n . The a-generalized graph over G, denoted by P a (G), consists of two disjoint, identical copies of G along with edges £a(£). In this paper, we investigated the relation between diameter of P a (G) and diameter of G for any pe

On 3-diameter-stable graphs of diameter

On 3-diameter-stable graphs of diameter 4

✍ Cheng-de Xu; Rui Gu 📂 Article 📅 2010 🏛 Chinese Electronic Periodical Services 🌐 English ⚖ 110 KB

On the diameters of commuting graphs

✍ S. Akbari; A. Mohammadian; H. Radjavi; P. Raja 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 200 KB

The commuting graph of a ring R, denoted by (R), is a graph whose vertices are all non-central elements of R and two distinct vertices x and y are adjacent if and only if xy = yx. Let D be a division ring and n 3. In this paper we investigate the diameters of (M n (D)) and determine the diameters of

On diameter 2-critical graphs

✍ Genghua Fan 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 296 KB

A graph is diameter 2-critical if the graph has diameter 2 and the deletion of any edge increases its diameter. We prove that if G is diameter 2-critical graph on n vertices and e edges, then (i) e ~< [14n2 ] for n <~ 24, and (ii) e < !4n2 + (n 2 -16.2 n + 56)/320 (<0.2532 n2), for n/> 25.

The diameter of directed graphs

✍ Peter Dankelmann 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 152 KB