Let G be a graph and let c(x,y) denote the number of vertices in G adjacent to both of the vertices x and y. We call G quadrangular if c(x,y) ~ 1 whenever x and y are distinct vertices in G. Reid and Thomassen proved that IE(G)I >t 21V(G)I -4 for each connected quadrangular graph (7, and characteriz
Matrices, graphs and equivalence relations
β Scribed by Libero Verardi
- Publisher
- Springer
- Year
- 2002
- Tongue
- English
- Weight
- 154 KB
- Volume
- 180
- Category
- Article
- ISSN
- 0373-3114
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In this paper, we define and study the switching classes of directed graphs. The definition is a generalization of both Van Lint and Seidel's switching classes of graphs and Cameron's switching classes of tournaments. We actually do it in a general way so that Wells" signed switching classes of grap
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
The Hermite indices are invariant for the right equivalence of non-singular polynomial matrices and for the similarity of controllable matrix pairs. Nevertheless, they do not form a complete system of invariants. The aim of this work is to define two equivalence relations, one in the set of non-sin