✦ LIBER ✦

An algebraic characterization of geodetic graphs

✍ Scribed by Ladislav Nebeský

Book ID: 110419960
Publisher: Springer
Year: 1998
Tongue: English
Weight: 339 KB
Volume: 48
Category: Article
ISSN: 0011-4642
DOI: 10.1023/a:1022435605919

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algebraic characterization of planar

An algebraic characterization of planar graphs

✍ Dan Archdeacon; C. Paul Bonnington; Charles H. C. Little 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 773 KB

## Abstract A cycle in a graph is a set of edges that covers each vertex an even number of times. A cocycle is a collection of edges that intersects each cycle in an even number of edges. A bicycle is a collection of edges that is both a cycle and a cocycle. The cycles, cocycles, and bicycles each

An algebraic characterization of project

An algebraic characterization of projective-planar graphs

✍ Lowell Abrams; Daniel C. Slilaty 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 114 KB

## Abstract We give a detailed algebraic characterization of when a graph __G__ can be imbedded in the projective plane. The characterization is in terms of the existence of a dual graph __G__\* on the same edge set as __G__, which satisfies algebraic conditions inspired by homology groups and inte

New proof of a characterization of geode

New proof of a characterization of geodetic graphs

✍ Ladislav Nebeský 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 89 KB

An extremal problem in geodetic graphs

✍ K.R. Parthasarathy; N. Srinivasan 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 365 KB

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

Geodetic metrizations of graphs

✍ Frank Rhodes; Robert A. Melter 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 665 KB

A graph can be metrized by assigning a length to each of its edges. Such a graph is said to be geodetic if for each pair of vertices there is a unique geodesic joining them. It is said to be normally geodetic if each of these unique geodesics is one of the geodesics in the usual metrization of the g