No Detail Found!

A survey of line digraphs and generalizations*

Author(s)
Jay S. Bagga Department of Computer Science, Ball State University,Muncie, Indiana,USA
Lowell W. Beineke Department of Mathematical Sciences, Purdue University Fort Wayne,Fort Wayne, Indiana,USA
Abstract
The line graph transformation is one of the most widely investigated operations in graph theory. Frank Harary was the first to generalize this concept to digraphs. Since then various other generalizations have been proposed and studied. In this paper we present a survey of line digraphs and their generalizations. [19] C. Heuchenne, Sur une certaine correspondance entre graphs, Bull. Soc. Royal. Sci. Li`ege 33 (1964) 743–753.
Publication Details
Page(s) 68-83
Published Journal: Discrete Mathematics Letters, Volume: 6, Issue: 0, Year: 2021

Request the full text from PASTIC

Keywords
total digraph, line digraph, line graph
References
Aigner M. .1967 .On the linegraph of a directed graph. , 102 : 56-61.
Bagga J. .2004 .Old and new generalizations of line graphs. Int. J. Math. Math. Sci. 29, : 1509-1521.
Bagga K. S.,Beineke L. W.,Varma B. N.,Alavi A .1995 .Super line graphs. Graph Theory, Combinatorics, and Applications, 1 : 35-46.
Bagga K. S.,Beineke L. W.,Varma B. N.,Alavi A .1995 .The line completion number of a graph. Graph Theory, Combinatorics, and Applications, 2 : 1197-1201.
Bagga J. S.,Beineke L. W.,Varma B. N. .1999 .Independence and cycles in super line graphs. Australas. J. Combin, 19 : 171-178.
Bagga J. S.,Beineke L. W.,Varma B. N. .1999 .The super line graph L2. , 206 : 51-61.
Bagga J. S.,Beineke L. W.,Varma B. N. .2016 .A number-theoretic problem on super line graphs. AKCE Int. J. Graphs Comb, 13 : 177-190.
Behzad M. .1965 .. , : .
Beineke L. W.,Bagga J. S. . .. Line Graphs and Line Digraphs, : .
Beineke L. W.,Zamfirescu C. M. .1982 .Connection digraphs and second-order line digraphs. , 39 : 237-254.
Broersma H. J.,Hoede C. .1989 .. J. Graph Theory, 13 : 427-444.
Broersma H. J.,Li X. .2002 .Isomorphisms and traversability of directed path graphs. Discuss. Math. Graph Theory, 22 : 215-228.
Chartrand G.,Stewart M. J. .1966 .. Canad. Math. Bull. 9, : 171-176.
Ferrero D. .1967 .. International Conference on Information Technology Proceedings ITNG 07, : 1073-1076.
Harary F.,Norman R. Z. . .Some properties of line digraphs. Rend. Circ. Mat. Palermo 2, 9(1960) : 161-168.
Hemminger R. L. .1974 .Digraphs with periodic line digraphs. Studia Sci. Math. Hungar. 9, : 27-31.
Hemminger R. L. .1989 .Characterization of nth line digraphs. Congr. Numer, 69 : 147-156.
Hemminger R. L.,Beineke L. W. .1978 .Line graphs and line digraphs. , : 271-305.
Heuchenne C. .1964 .Sur une certaine correspondance entre graphs. Bull. Soc. Royal. Sci. Lie`ge 33, : 743-753.
Li X.,Liu Y.,Zhao B. .2011 .Isomorphisms of directed P!3-graphs. , 101 : 435-448.
Liu J.,Meng J. .2008 .Super-arc-connected and super-connected total digraphs. Ars Combin, 87 : 97-104.
P. I. Richards .1967 .Precedence constraints and arrow diagrams. SIAM Rev, 9 : 548-553.
Skowron M.,Zamfirescu C. .1986 .An algorithmic characterization of total digraphs. J. Algorithms, 7 : 120-133.
Whitney H. .1932 .Congruent graphs and the connectivity of graphs, Amer. , 54 : 150-168.
0

Citations

0

Downloads

24

Views