𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Diameters of pseudosymmetric graphs

✍ Scribed by A. V. Knyazev

Book ID
105099067
Publisher
SP MAIK Nauka/Interperiodica
Year
1987
Tongue
English
Weight
524 KB
Volume
41
Category
Article
ISSN
0001-4346

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Two Theorems on Pseudosymmetric Graphs
Two Theorems on Pseudosymmetric Graphs
✍ Gupta, Ram Prakash πŸ“‚ Article πŸ“… 1967 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 368 KB
Diameters of cubic graphs
Diameters of cubic graphs
✍ Leif K. JΓΈrgensen πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 440 KB
Diameters of random bipartite graphs
Diameters of random bipartite graphs
✍ BΓ©la BollobΓ‘s; Victor Klee πŸ“‚ Article πŸ“… 1984 πŸ› Springer-Verlag 🌐 English βš– 485 KB
Diameters of iterated clique graphs of c
Diameters of iterated clique graphs of chordal graphs
✍ Bor-Liang Chen; Ko-Wei Lih πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 272 KB

## Abstract The clique graph __K__(__G__) of a graph is the intersection graph of maximal cliques of __G.__ The iterated clique graph __K__^__n__^(__G__) is inductively defined as __K__(K^nβˆ’1^(__G__)) and __K__^1^(__G__) = __K__(__G__). Let the diameter diam(__G__) be the greatest distance between

Wide diameters of de Bruijn graphs
Wide diameters of de Bruijn graphs
✍ Jyhmin Kuo; Hung-Lin Fu πŸ“‚ Article πŸ“… 2007 πŸ› Springer US 🌐 English βš– 288 KB