Generalizations of Line Graphs and Applications

@article{Deo1977GeneralizationsOL,
  title={Generalizations of Line Graphs and Applications},
  author={N. Deo and M. Krishnamoorthy and Ajit B. Pai},
  journal={Inf. Process. Lett.},
  year={1977},
  volume={6},
  pages={14-17}
}
Only loopless, undirected, finite graphs without multiple edges will be considered here. The more-orless standard graph terminology used here can be found in mos: text books on graph theory, e.g. [ 1 ,5]. We denote a graph G = (V, E) w’here V is the set of vertices, and E, the set of edges of G. An ever1 (oddjfactor fof G is a non-null spanning subgraph of G, such that the degree of every vertex in fis even (odd). A perfect matchbg in a graph G is a spanning subgraph in which the degree of… Expand
4 Citations
Excluding a bipartite circle graph from line graphs
  • 10
Parity and disparity subgraphs
Excluding a bipartite circle graph from line graphs
  • 13
  • PDF
A Note on Odd and Even Factors of Undirected Graphs
  • J. Ebert
  • Mathematics, Computer Science
  • Inf. Process. Lett.
  • 1980
  • 2

References

SHOWING 1-10 OF 10 REFERENCES
An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
  • 159
Graph theory with applications to engineering and computer science
  • N. Malik
  • Computer Science
  • Proceedings of the IEEE
  • 1975
  • 924
: hWilliams , On eulerian and hamiltonian graphs and line graphs , Canad , Xath
  • Bull .
  • 1969
Graph theory
  • 13,757
  • PDF
Cut-set matrices and linear codes (Corresp.)
  • 36
Nr:h-Williams, On eulerian and hamiltonian graphs and line graphs, Canad
  • Xath. Bull
  • 1965
A topological approach to constructicsn of group codes
  • J. Inst. Elec. Commun. Engrs. (Japan?
  • 1961