𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The binding number of line graphs and total graphs

✍ Scribed by Akira Saito; Tian Songlin

Book ID
110567497
Publisher
Springer Japan
Year
1985
Tongue
English
Weight
220 KB
Volume
1
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The decompositions of line graphs, middl
The decompositions of line graphs, middle graphs and total graphs of complete graphs into forests
✍ Jin Akiyama; Takashi Hamada πŸ“‚ Article πŸ“… 1979 πŸ› Elsevier Science 🌐 English βš– 461 KB

We construct decompositions of L(K,,), M(K,,) and T(K,,) into the minimum number of line-disjoint spanning forests by applying the usual criterion for a graph to be eulerian. This gives a realization of the arboricity of each of these three graphs. ## 1. Preliminaries In this paper a graph is cons

Perfect k-line graphs and k-total graphs
Perfect k-line graphs and k-total graphs
✍ Van Bang LΓͺ πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 443 KB πŸ‘ 1 views

## Abstract The concept of the line graph can be generalized as follows. The __k__‐line graph __L__~__k__~(__G__) of a graph __G__ is defined as a graph whose vertices are the complete subgraphs on __k__ vertices in __G.__ Two distinct such complete subgraphs are adjacent in __L__~__k__~(__G__) if

The binding number of Halin graphs
The binding number of Halin graphs
✍ MirosΕ‚awa SkowroΕ„ska πŸ“‚ Article πŸ“… 1988 πŸ› Elsevier Science 🌐 English βš– 304 KB
The connectivities of line and total gra
The connectivities of line and total graphs
✍ Douglas Bauer; Ralph Tindell πŸ“‚ Article πŸ“… 1982 πŸ› John Wiley and Sons 🌐 English βš– 371 KB πŸ‘ 1 views

## Abstract Sharp lower bounds for the point connectivity and line connectivity of the line graph __L(G__) and the total graph __T(G__) of a graph __G__ are determined. The lower bounds are expressed in terms of the point connectivity __k__, line connectivity Ξ», and minimum degree Ξ΄ of __G.__ It is