𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Unimodular equivalence of graphs

✍ Scribed by Russell Merris

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
567 KB
Volume
173
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On unimodular graphs
On unimodular graphs
✍ S. Akbari; S.J. Kirkland πŸ“‚ Article πŸ“… 2007 πŸ› Elsevier Science 🌐 English βš– 169 KB
Restricted unimodular chordal graphs
Restricted unimodular chordal graphs
✍ Peled, Uri N.; Wu, Julin πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 176 KB πŸ‘ 1 views

A chordal graph is called restricted unimodular if each cycle of its vertex-clique incidence bipartite graph has length divisible by 4. We characterize these graphs within all chordal graphs by forbidden induced subgraphs, by minimal relative separators, and in other ways. We show how to construct t

Unimodularity and circle graphs
Unimodularity and circle graphs
✍ AndrΓ© Bouchet πŸ“‚ Article πŸ“… 1987 πŸ› Elsevier Science 🌐 English βš– 309 KB

A property of unimodularity is introduced for antisymmetric integral matrices. It is satisfied by the adjacency matrix of a circle graph provided with a Naji orientation . In a further paper we shall interprete this result in terms of symmetric matroids introduced in . In this communication we give

On ?-equivalence and ?-equivalence of gr
On ?-equivalence and ?-equivalence of graphs
✍ Du, Qingyan πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 336 KB πŸ‘ 1 views

W e define a partial ordering on the set of a-polynomials as well as a vertex splitting operation on the set of graphs, and introduce the notions of (r-equivalence and (r- uniqueness of graphs. Let a ( G ) be the a-polynomial of a graph G and a ( G ) = (r(GC). Let H = (G, u , A, 5) be a vertex spli