𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A good characterization of squares of strongly chordal split graphs

✍ Scribed by Van Bang Le; Ngoc Tuy Nguyen

Book ID
108154732
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
141 KB
Volume
111
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A characterization of strongly chordal g
A characterization of strongly chordal graphs
✍ Elias Dahlhaus; Paul D. Manuel; Mirka Miller πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 119 KB

In this paper, we present a simple charactrization of strongly chordal graphs. A chordal graph is strongly chordal if and only if every cycle on six or more vertices has an induced triangle with exactly two edges of the triangle as the chords of the cycle. (~

The square of a chordal graph
The square of a chordal graph
✍ Frank Harary; Terry A. McKee πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 427 KB

We introduce the closed-neighborhood intersection multigraph as a useful multigraph version of the square of a graph. We characterize those multigraphs which are squares of chordal graphs and include an algorithm to go from the squared chordal graph back to its (unique!) square root. This becomes pa

The w-median of a connected strongly cho
The w-median of a connected strongly chordal graph
✍ Hai-Yen Lee; Gerard J. Chang πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 337 KB πŸ‘ 1 views

## Abstract Suppose __G = (V, E)__ is a graph in which every vertex __x__ has a non‐negative real number __w(x)__ as its weight. The __w__‐distance sum of a vertex __y__ is __D~G, w~(y)__ = Οƒ~xβ‰…v~ __d(y, x)w(x).__ The __w__‐median of __G__ is the set of all vertices __y__ with minimum __w__‐distanc

A Dirac-type characterization of -chorda
A Dirac-type characterization of -chordal graphs
✍ Krithika, R.; Mathew, Rogers; Narayanaswamy, N.S.; Sadagopan, N. πŸ“‚ Article πŸ“… 2013 πŸ› Elsevier Science 🌐 English βš– 359 KB