Let G be a finite simple graph and let 4(G) be the set of subsets X of V(G) such that the subgraph of G induced by X is threshold. If 4(G) is the independence system of a matroid, then G is called matrogenic [3]. In this paper, we characterize matroids arising from matrogenic graphs.
Generalized Matrogenic Graphs
β Scribed by Igor E. Zverovich
- Book ID
- 105764734
- Publisher
- Springer
- Year
- 2006
- Tongue
- English
- Weight
- 107 KB
- Volume
- 10
- Category
- Article
- ISSN
- 0218-0006
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract Generalized line graphs extend the ideas of both line graphs and cocktail party graphs. They were originally motivated by spectral considerations. in this paper several (nonspectral) classical theorems about line graphs are extended to generalized line graphs, including the derivation a
## Abstract A generalized Steinhaus graph of order __n__ and type __s__ is a graph with __n__ vertices whose adjacency matrix (__a__~i,j~) satisfies the relation magnified image where 2 β¦__i__β¦__n__β1, __i__ + __s__(__i__ β 1 β¦ __j__ β¦ __n__, __c__~r,i,j~ Ο΅ {0,1} for all 0 β¦ __r__ β¦ __s__(__i__) β1
## We introduce the concept of generalized Cayley graphs and study their properties, in particular relative to double coverings of graphs.