In this paper we explore the c:oncept of factoring a graph into non-isomorphic paths. Lel Pi denote the path of length i. We SAY that a graph G having $n(n + 1) edges is path-perfect if E( G) can be partitioned as E, UE, !J l \* l U & such that the subgraph of G induced by 32i is isomorphic to Pr, f
A note on path-zero graphs
β Scribed by J.J. Seidel
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 207 KB
- Volume
- 106-107
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
of the matrix equation P*(X,,) = O,, where Pk(k) is the characteristic equation of the path-graph of length k.
π SIMILAR VOLUMES
## Abstract In the study of decompositions of graphs into paths and cycles, the following questions have arisen: Is it true that every graph __G__ has a smallest path (resp. pathβcycle) decomposition __P__ such that every odd vertex of __G__ is the endpoint of exactly one path of __P__? This note g
The hamiltonian path graph H(F) of a graph F is that graph having the same vertex set as F and in which two vertices u and u are adjacent if and only if F contains a hamiltonian u -u path. First, in response to a conjecture of Chartrand, Kapoor and Nordhaus, a characterization of nonhamiltonian grap
## Abstract An application of conservative graphs to topological graph theory is indicated.
## Abstract Coset graphs are a generalization of Cayley graphs. They arise in the construction of graphs and digraphs with transitive automorphism groups. Moreover, the consideration of coset graphs makes it possible to give an algebraic description of regular connected graphs of even degree. In th