Some properties of line digraphs
From MaRDI portal
Cites work
Cited in
(77)- Line digraphs and the Moore-Penrose inverse
- Connection digraphs and second-order line digraphs
- The underlying graph of a line digraph
- Line-digraphs, arborescences and theorems of Tutte and Knuth
- On a problem of walks
- Parallel \(N\)-free order recognition
- Heredity of the index of convergence of the line digraph
- When a digraph and its line digraph are connected and cospectral
- Line digraphs and coreflexive vertex sets
- Random walks and diffusion on networks
- On directed covering and domination problems
- Algebraic bounds for heterogeneous site percolation on directed and undirected graphs
- Reconstructing a graph from its arc incidence graph
- Cross-series-parallel digraphs
- CMMSE 18: geometric-arithmetic index and line graph
- Line graphs of monogenic semigroup graphs
- Equitable edge partitions and Kirchhoff graphs
- Total domination on tree operators
- Sharp bounds on the arithmetic-geometric index of graphs and line graphs
- Bipartite consensus of high-order edge dynamics on coopetition multiagent systems
- Relations between some topological indices and the line graph
- Hyperbolicity on graph operators
- Edge-version atom-bond connectivity and geometric arithmetic indices of generalized bridge molecular graphs
- On \(\bullet\)-line signed graphs \(L_\bullet(S)\)
- On commutativity of two unary digraph operations: subdividing and line-digraphing
- Semigroups for flows in infinite networks
- The number of paths and cycles in a digraph
- Extremal problems on exponential vertex-degree-based topological indices
- General sum-connectivity index of a graph and its line graph
- Eco-driving in urban traffic networks using traffic signals information
- Minimum flow variation in maximum flows
- Miscellaneous digraph classes
- Formal zeta function expansions and the frequency of Ramanujan graphs
- Limit points of eigenvalues of (di)graphs
- Characterization of signed line digraphs
- A bibliography of graph equations
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets
- A survey of the studies on Gallai and anti-Gallai graphs
- New results on directed edge dominating set
- The why, how, and when of representations for complex systems
- A graph theoretical framework for the strong Gram classification of non-negative unit forms of Dynkin type \(\mathbb{A}_n\)
- On \(d\)-Fibonacci digraphs
- On directed covering and domination problems
- Edge consensus on complex networks: a structural analysis
- A new solvable case of the traveling salesman problem
- A survey of line digraphs and generalizations
- Recent Results on Hyperbolicity on Unitary Operators on Graphs
- scientific article; zbMATH DE number 7687414 (Why is no real title available?)
- 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
- 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
- Hochschild homology, and a persistent approach via connectivity digraphs
- Some inner metric parameters of a digraph: iterated line digraphs and integer sequences
- The differential on graph operator \(\mathrm{R}(G)\)
- Line graphs of directed graphs. I.
- From length-preserving pushouts of graphs to one-surjective pullbacks of graph algebras
- A characterization of line graphs of directed graphs
- A bi-criterion Steiner traveling salesperson problem with time windows for last-mile electric vehicle logistics
- In-domatic number and some operations in digraphs
- Some spectral properties of oriented line graphs
- Line digraphs of polytrees
- Enumerating graphlets with amortized time complexity independent of graph size
- Simulating the impact of dynamic rerouting on metropolitan-scale traffic systems
- On the degeneracy of spin ice graphs, and its estimate via the Bethe permanent
- Dynamics of one-dimensional spin models under the line-graph operator
- On m-bonacci intersection-sum graphs
- Correcting a graph into a linegraph minimizing Hamming distance edition is NP-complete and FPT by treewidth
- New hardness results for low-rank matrix completion
- On the differential in central operator \(\mathcal{C} (G)\)
- Optimal constructions of reversible digraphs
- Relations between the general sum connectivity index and the line graph
This page was built for publication: Some properties of line digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q773873)
