Skoči na glavni sadržaj

Mathematical Communications, Vol. 9 No. 2, 2004.

Izvorni znanstveni članak

On path graphs of incidence graphs

D. Crnković

Puni tekst: engleski pdf 118 Kb

str. 181-188

preuzimanja: 1.089

citiraj

Sažetak

For a given graph $G$ and a positive integer $k$ the $P_k$-path graph $P_k(G)$ has for vertices the set of paths of length $k$ in $G$.
Two vertices are connected in $P_k(G)$ when the intersection of the
corresponding paths forms a path of length $k-1$ in $G$, and their union forms either a cycle or a path of length $k+1$. Path graphs were proposed as a generalization of line graphs.
In this article we investigate some properties of path graphs of bipartite graphs, especially path graphs of incidence graphs of configurations.

Ključne riječi

path graph; bipartite graph; perfect graph; incidence graph

Hrčak ID:

686

URI

https://hrcak.srce.hr/686

Datum izdavanja:

22.12.2004.

Posjeta: 1.941 *