𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A characterization of long graphs of arbitrary rank

✍ Scribed by Dein Wong; Min Zhu; Wenping Lv

Book ID
119317717
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
277 KB
Volume
438
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A characterization of graphs with rank 5
A characterization of graphs with rank 5
✍ Gerard J. Chang; Liang-Hao Huang; Hong-Gwa Yeh πŸ“‚ Article πŸ“… 2012 πŸ› Elsevier Science 🌐 English βš– 988 KB
A characterization of graphs with rank 4
A characterization of graphs with rank 4
✍ Gerard J. Chang; Liang-Hao Huang; Hong-Gwa Yeh πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 270 KB
A characterization of graphs without lon
A characterization of graphs without long induced paths
✍ GΓ‘bor BacsΓ³; Zsolt Tuza πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 461 KB πŸ‘ 1 views

## Abstract In a connected graph define the k‐center as the set of vertices whose distance from any other vertex is at most __k.__ We say that a vertex set __S__ __d__‐dominates __G__ if for every vertex x there is a y ∈ __S__ whose distance from __x__ is at most __d__. Call a graph __P~t~__‐free

Rankings of Graphs
Rankings of Graphs
✍ Bodlaender, Hans L.; Deogun, Jitender S.; Jansen, Klaus; Kloks, Ton; Kratsch, Di πŸ“‚ Article πŸ“… 1998 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 305 KB
Medians of arbitrary graphs
Medians of arbitrary graphs
✍ Peter J. Slater πŸ“‚ Article πŸ“… 1980 πŸ› John Wiley and Sons 🌐 English βš– 165 KB

## Abstract For each vertex __u__ in a connected graph __H__, the __distance__ of __u__ is the sum of the distances from __u__ to each of the vertices __v__ of __H.__ A vertex of minimum distance in __H__ is called a __median__ vertex. It is shown that for any graph __G__ there exists a graph __H__