Old and new generalizations of line graphs

DOI10.1155/S0161171204310094zbMath1061.05078OpenAlexW1999055138MaRDI QIDQ1774770

Jay S. Bagga

Publication date: 18 May 2005

Published in: International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/51250

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (14)

Line Completion Number of Grid Graph $P_n \times P_m$ ⋮ Enriched line graph: a new structure for searching language collocations ⋮ Induced cycles in triangle graphs ⋮ On the hyperbolicity of bipartite graphs and intersection graphs ⋮ Small edge sets meeting all triangles of a graph ⋮ Generalized line graphs: Cartesian products and complexity of recognition ⋮ Line graphs for a multiplex network ⋮ New results and open problems in line graphs ⋮ The structure and dynamics of networks with higher order interactions ⋮ On the edges’ PageRank and line graphs ⋮ Path-comprehensive and vertex-pancyclic properties of super line graph \(\mathcal L_2(G)\) ⋮ Unnamed Item ⋮ The line completion number of hypercubes ⋮ A survey of line digraphs and generalizations

This page was built for publication: Old and new generalizations of line graphs