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
β¦ LIBER β¦
On unimodular graphs
β Scribed by S. Akbari; S.J. Kirkland
- Publisher
- Elsevier Science
- Year
- 2007
- Tongue
- English
- Weight
- 169 KB
- Volume
- 421
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Restricted unimodular chordal graphs
β
Peled, Uri N.; Wu, Julin
π
Article
π
1999
π
John Wiley and Sons
π
English
β 176 KB
π 1 views
Unimodular equivalence of graphs
β
Russell Merris
π
Article
π
1992
π
Elsevier Science
π
English
β 567 KB
A note on unimodular congruence of graph
β
Russell Merris
π
Article
π
1994
π
Elsevier Science
π
English
β 407 KB
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
Unimodular congruence of the Laplacian m
β
William Watkins
π
Article
π
1994
π
Elsevier Science
π
English
β 609 KB
On totally unimodular matrices
β
A. Tamir
π
Article
π
1976
π
John Wiley and Sons
π
English
β 431 KB
## Abstract Conditions for a matrix to be totally unimodular, due to Camion, are applied to extend and simplify proofs of other characterizations of total unimodularity.