Pregled bibliografske jedinice broj: 186953
On path graphs of incidence graphs
On path graphs of incidence graphs // Mathematical communications, 9 (2004), 2; 181-188 (podatak o recenziji nije dostupan, članak, znanstveni)
CROSBI ID: 186953 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
On path graphs of incidence graphs
Autori
Crnković, Dean
Izvornik
Mathematical communications (1331-0623) 9
(2004), 2;
181-188
Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni
Ključne riječi
path graph; bipartite graph; perfect graph; incidence graph
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.
Izvorni jezik
Engleski
Znanstvena područja
Matematika
POVEZANOST RADA
Citiraj ovu publikaciju:
Uključenost u ostale bibliografske baze podataka::
- Mathematical Reviews
- Zentralblatt MATH