Some properties of line digraphs

From MaRDI portal
Revision as of 10:46, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:773873

DOI10.1007/BF02854581zbMath0099.18205OpenAlexW2093882311WikidataQ56388837 ScholiaQ56388837MaRDI QIDQ773873

Frank Harary, Robert Z. Norman

Publication date: 1960

Published in: Rendiconti del Circolo Matemàtico di Palermo. Serie II (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02854581






Related Items (63)

Recent Results on Hyperbolicity on Unitary Operators on GraphsRelations between the general sum connectivity index and the line graphSharp bounds on the arithmetic-geometric index of graphs and line graphsOn d-Fibonacci digraphsCharacterization of signed line digraphsNew Results on Directed Edge Dominating SetReconstructing a graph from its arc incidence graphParallel \(N\)-free order recognitionEdge consensus on complex networks: a structural analysisRandom walks and diffusion on networksImproved NP-Hardness of Approximation for Orthogonality Dimension and MinrankGeneral Randić indices of a graph and its line graphThere is no going back: properties of the non-backtracking LaplacianNew results and open problems in line graphsNavigational guidance -- a deep learning approachMINIMAL EDGE CONTROLLABILITY OF DIRECTED NETWORKSExtremal problems on exponential vertex-degree-based topological indicesLine digraphs and the Moore-Penrose inverseOn commutativity of two unary digraph operations: subdividing and line-digraphingHeredity of the index of convergence of the line digraphA new solvable case of the traveling salesman problemGeneral sum-connectivity index of a graph and its line graphUnnamed ItemConnection digraphs and second-order line digraphsFormal Zeta function expansions and the frequency of Ramanujan graphsOn directed covering and domination problemsAn incremental polynomial time algorithm to enumerate all minimal edge dominating setsCross-series-parallel digraphsHochschild homology, and a persistent approach via connectivity digraphsThe underlying graph of a line digraphCMMSE 18: geometric-arithmetic index and line graphSemigroups for flows in infinite networksA bibliography of graph equationsLine-digraphs, arborescences and theorems of Tutte and KnuthLimit points of eigenvalues of (di)graphsAlgebraic bounds for heterogeneous site percolation on directed and undirected graphsMINIMUM FLOW VARIATION IN MAXIMUM FLOWSEco-driving in urban traffic networks using traffic signals informationLine graphs of monogenic semigroup graphsInterplay between topology and edge weights in real-world graphs: concepts, patterns, and an algorithmOriented vertex and arc coloring of edge series-parallel digraphsMetric dimension of line graphs of Bakelite and subdivided Bakelite networkSome inner metric parameters of a digraph: iterated line digraphs and integer sequencesThe number of paths and cycles in a digraphThe differential on graph operator \(\mathrm{R}(G)\)Line graphs of directed graphs. I.Bipartite consensus of high-order edge dynamics on coopetition multiagent systemsRelations between some topological indices and the line graphEquitable edge partitions and Kirchhoff graphsOn a problem of walksMiscellaneous Digraph ClassesWhen a digraph and its line digraph are connected and cospectralLine digraphs and coreflexive vertex setsHyperbolicity on graph operatorsEdge-version atom-bond connectivity and geometric arithmetic indices of generalized bridge molecular graphsThe Why, How, and When of Representations for Complex SystemsOn \(\bullet\)-line signed graphs \(L_\bullet(S)\)A survey of line digraphs and generalizationsOptimal constructions of reversible digraphsOn Directed Covering and Domination ProblemsTotal domination on tree operatorsA Graph Theoretical Framework for the Strong Gram Classification of Non-negative Unit Forms of Dynkin Type 𝔸nA survey of the studies on Gallai and anti-Gallai graphs




Cites Work




This page was built for publication: Some properties of line digraphs