✦ LIBER ✦

On the geodetic number of a graph

✍ Scribed by Gary Chartrand; Frank Harary; Ping Zhang

Publisher: John Wiley and Sons
Year: 2001
Tongue: English
Weight: 308 KB
Volume: 39
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.10007

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Geodetic Number of an Oriented Graph

✍ Gary Chartrand; Ping Zhang 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 149 KB

For two vertices u and v of an oriented graph D, the set I (u, v) consists of all vertices lying on a uv geodesic or vu geodesic in D. If S is a set of vertices of D, then I (S) is the union of all sets I (u, v) for vertices u and v in S. The geodetic number g(D) is the minimum cardinality among the

On the Interval Number of a Triangulated

On the Interval Number of a Triangulated Graph

✍ Thomas Andreae 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 414 KB 👁 2 views

The interval number of a simple undirected graph G, denoted i(G), is the least nonnegative integer r for which we can assign to each vertex in G a collection of at most r intervals on the real line such that two distinct vertices u and w of G are adjacent if and only if some interval for u intersect

On the interval number of a chordal grap

On the interval number of a chordal graph

✍ Edward R. Scheinerman 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 249 KB 👁 2 views

The interval number of a (simple, undirected) graph G is the least positive integer t such that G is the intersection graph of sets, each of which is the union of t real intervals. A chordal (or triangulated) graph is one with no induced cycles on 4 or more vertices. If G is chordal and has maximum

A lower bound on the chromatic number of

A lower bound on the chromatic number of a graph

✍ B. R. Myers; R. Liu 📂 Article 📅 1971 🏛 John Wiley and Sons 🌐 English ⚖ 150 KB 👁 1 views

A note on the bichromatic numbers of gra

A note on the bichromatic numbers of graphs

✍ Dennis D. A. Epple; Jing Huang 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 90 KB 👁 2 views

On the number of maximal bipartite subgr

On the number of maximal bipartite subgraphs of a graph

✍ Jesper Makholm Byskov; Bolette Ammitzbøll Madsen; Bjarke Skjernaa 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 72 KB 👁 2 views

We show new lower and upper bounds on the maximum number of maximal induced bipartite subgraphs of graphs with n vertices. We present an infinite family of graphs having 105 n=10 % 1:5926 n ; such subgraphs show an upper bound of O(12 n=4 ) ¼ O(1:8613 n ) and give an algorithm that finds all maximal