Each graph is an intersection graph (intersection multigraph) of a family of sets. Such a family is called a representation if all sets are different and a pseudorepresentation if some are the same. By intersection number we mean the cardinality of the smallest set on which we can construct a repres
β¦ LIBER β¦
Properties of spectra of graphs and line graphs
β Scribed by Chen Yan
- Book ID
- 107500531
- Publisher
- SP Editorial Committee of Applied Mathematics - A Journal of Chinese Universities
- Year
- 2002
- Tongue
- English
- Weight
- 261 KB
- Volume
- 17
- Category
- Article
- ISSN
- 1005-1031
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Intersection properties of line graphs
β
StanisΕaw Bylka; Jan Komar
π
Article
π
1997
π
Elsevier Science
π
English
β 515 KB
Outerplanarity of line graphs and iterat
β
Huiqiu Lin; Weihua Yang; Hailiang Zhang; Jinlong Shu
π
Article
π
2011
π
Elsevier Science
π
English
β 382 KB
The line graphs of lollipop graphs are d
β
Jianfeng Wang; Shuning Shi
π
Article
π
2012
π
Elsevier Science
π
English
β 340 KB
Statistical properties of quantum graph
β
Yu. Dabaghian
π
Article
π
2006
π
SP MAIK Nauka/Interperiodica
π
English
β 166 KB
Clique-transversal sets of line graphs a
β
Thomas Andreae; Martin Schughart; Zsolt Tuza
π
Article
π
1991
π
Elsevier Science
π
English
β 704 KB
Andreae, T., M. Schughart and Z. Tuza, Clique-transversal sets of line graphs and complements of line graphs, Discrete Mathematics 88 (1991) 11-20. A clique-transversal set T of a graph G is a set of vertices of G such that T meets all maximal cliques of G. The clique-transversal number, denoted t,(
Collapsible graphs and Hamiltonian conne
β
Weihua Yang; Hongjian Lai; Hao Li; Xiaofeng Guo
π
Article
π
2012
π
Elsevier Science
π
English
β 223 KB