Some properties of line digraphs
From MaRDI portal
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 Graphs ⋮ Relations between the general sum connectivity index and the line graph ⋮ Sharp bounds on the arithmetic-geometric index of graphs and line graphs ⋮ On d-Fibonacci digraphs ⋮ Characterization of signed line digraphs ⋮ New Results on Directed Edge Dominating Set ⋮ Reconstructing a graph from its arc incidence graph ⋮ Parallel \(N\)-free order recognition ⋮ Edge consensus on complex networks: a structural analysis ⋮ Random walks and diffusion on networks ⋮ Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank ⋮ General Randić indices of a graph and its line graph ⋮ There is no going back: properties of the non-backtracking Laplacian ⋮ New results and open problems in line graphs ⋮ Navigational guidance -- a deep learning approach ⋮ MINIMAL EDGE CONTROLLABILITY OF DIRECTED NETWORKS ⋮ Extremal problems on exponential vertex-degree-based topological indices ⋮ Line digraphs and the Moore-Penrose inverse ⋮ On commutativity of two unary digraph operations: subdividing and line-digraphing ⋮ Heredity of the index of convergence of the line digraph ⋮ A new solvable case of the traveling salesman problem ⋮ General sum-connectivity index of a graph and its line graph ⋮ Unnamed Item ⋮ Connection digraphs and second-order line digraphs ⋮ Formal Zeta function expansions and the frequency of Ramanujan graphs ⋮ On directed covering and domination problems ⋮ An incremental polynomial time algorithm to enumerate all minimal edge dominating sets ⋮ Cross-series-parallel digraphs ⋮ Hochschild homology, and a persistent approach via connectivity digraphs ⋮ The underlying graph of a line digraph ⋮ CMMSE 18: geometric-arithmetic index and line graph ⋮ Semigroups for flows in infinite networks ⋮ A bibliography of graph equations ⋮ Line-digraphs, arborescences and theorems of Tutte and Knuth ⋮ Limit points of eigenvalues of (di)graphs ⋮ Algebraic bounds for heterogeneous site percolation on directed and undirected graphs ⋮ MINIMUM FLOW VARIATION IN MAXIMUM FLOWS ⋮ Eco-driving in urban traffic networks using traffic signals information ⋮ Line graphs of monogenic semigroup graphs ⋮ Interplay between topology and edge weights in real-world graphs: concepts, patterns, and an algorithm ⋮ Oriented vertex and arc coloring of edge series-parallel digraphs ⋮ Metric dimension of line graphs of Bakelite and subdivided Bakelite network ⋮ Some inner metric parameters of a digraph: iterated line digraphs and integer sequences ⋮ The number of paths and cycles in a digraph ⋮ The differential on graph operator \(\mathrm{R}(G)\) ⋮ Line graphs of directed graphs. I. ⋮ Bipartite consensus of high-order edge dynamics on coopetition multiagent systems ⋮ Relations between some topological indices and the line graph ⋮ Equitable edge partitions and Kirchhoff graphs ⋮ On a problem of walks ⋮ Miscellaneous Digraph Classes ⋮ When a digraph and its line digraph are connected and cospectral ⋮ Line digraphs and coreflexive vertex sets ⋮ Hyperbolicity on graph operators ⋮ Edge-version atom-bond connectivity and geometric arithmetic indices of generalized bridge molecular graphs ⋮ The Why, How, and When of Representations for Complex Systems ⋮ On \(\bullet\)-line signed graphs \(L_\bullet(S)\) ⋮ A survey of line digraphs and generalizations ⋮ Optimal constructions of reversible digraphs ⋮ On Directed Covering and Domination Problems ⋮ Total domination on tree operators ⋮ A Graph Theoretical Framework for the Strong Gram Classification of Non-negative Unit Forms of Dynkin Type 𝔸n ⋮ A survey of the studies on Gallai and anti-Gallai graphs
Cites Work
This page was built for publication: Some properties of line digraphs