On the public citation graph
The connectivity of line-graphs
0 signed · 77 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-1-4612-2972-8_4openalex-snapshot
Congruent Graphs and the Connectivity of Graphs
inferredcites →https://doi.org/10.2307/1911908openalex-snapshot
The Theory of Graphs and Its Applications
inferredcites →https://doi.org/10.2307/2371086openalex-snapshot
Congruent Graphs and the Connectivity of Graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.23127openalex-snapshot
Counting connected partitions of graphs
inferred← citeshttps://doi.org/10.1002/jgt.3190030410openalex-snapshot
Graphs with prescribed connectivity and line graph connectivity
inferred← citeshttps://doi.org/10.1002/jgt.3190060214openalex-snapshot
The connectivities of line and total graphs
inferred← citeshttps://doi.org/10.1007/3-540-55121-2_16openalex-snapshot
Line digraph iterations and the spread concept—with application to graph theory, fault tolerance, and routing
inferred← citeshttps://doi.org/10.1007/978-3-030-81386-4_1openalex-snapshot
Fundamentals of Line Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-81386-4_10openalex-snapshot
Fundamentals of Line Digraphs
inferred← citeshttps://doi.org/10.1007/978-3-030-81386-4_6openalex-snapshot
Connectivity of Line Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-33828-6_4openalex-snapshot
Sharp Bounds of the Generalized (Edge-)Connectivity
inferred← citeshttps://doi.org/10.1007/978-3-319-71150-8_14openalex-snapshot
Conflict-Free Connection Numbers of Line Graphs
inferred← citeshttps://doi.org/10.1007/bf01396460openalex-snapshot
On the line-connectivity of line-graphs
inferred← citeshttps://doi.org/10.1007/bf01419429openalex-snapshot
On the connectivity of total graphs
inferred← citeshttps://doi.org/10.1007/bf01419431openalex-snapshot
Connectivity, line-connectivity andJ-connection of the total graph
inferred← citeshttps://doi.org/10.1007/bfb0060111openalex-snapshot
Incidence patterns of graphs and complexes
inferred← citeshttps://doi.org/10.1007/s40840-016-0441-0openalex-snapshot
A Result on the 3-Generalized Connectivity of a Graph and Its Line Graph
inferred← citeshttps://doi.org/10.1016/0012-365x(76)90037-6openalex-snapshot
Traversability and connectivity of the middle graph of a graph
inferred← citeshttps://doi.org/10.1016/0012-365x(81)90058-3openalex-snapshot
On line graphs and the hamiltonian index
inferred← citeshttps://doi.org/10.1016/j.aam.2025.102868openalex-snapshot
Coefficients of the Tutte polynomial and minimal edge cuts of a graph
inferred← citeshttps://doi.org/10.1016/j.amc.2018.11.038openalex-snapshot
The generalized connectivity of the line graph and the total graph for the complete bipartite graph
inferred← citeshttps://doi.org/10.1016/j.amc.2022.126990openalex-snapshot
Internally disjoint trees in the line graph and total graph of the complete bipartite graph
inferred← citeshttps://doi.org/10.1016/j.amc.2023.128182openalex-snapshot
Path connectivity of line graphs and total graphs of complete bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.comnet.2025.111981openalex-snapshot
Vertex-independent spanning trees in data center network BCDC
inferred← citeshttps://doi.org/10.1016/j.dam.2007.04.003openalex-snapshot
A sufficient condition for Pk -path graphs being r-connected
inferred← citeshttps://doi.org/10.1016/j.dam.2010.08.024openalex-snapshot
Connectivity of iterated line graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2020.05.002openalex-snapshot
The κk -connectivity of line graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2022.09.025openalex-snapshot
On the dominating (induced) cycles of iterated line graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2025.01.029openalex-snapshot
On the edge-connectivity of the square of a graph
inferred← citeshttps://doi.org/10.1016/j.dam.2026.03.002openalex-snapshot
On maximally edge-connectivity of squares of graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2004.05.007openalex-snapshot
Edge-connectivity in Pk -path graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2004.11.025openalex-snapshot
Tutte uniqueness of line graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2007.06.035openalex-snapshot
Maximally edge-connected and vertex-connected graphs and digraphs: A survey
inferred← citeshttps://doi.org/10.1016/j.disc.2009.07.022openalex-snapshot
A note on vertex-transitive non-Cayley graphs from Cayley graphs generated by involutions
inferred← citeshttps://doi.org/10.1016/j.disc.2018.03.021openalex-snapshot
Steiner tree packing number and tree connectivity
inferred← citeshttps://doi.org/10.1016/j.disc.2018.08.029openalex-snapshot
Essential edge connectivity of line graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2018.09.005openalex-snapshot
Packing spanning trees in highly essentially connected graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112617openalex-snapshot
k-tree connectivity of line graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2022.112920openalex-snapshot
Index of parameters of iterated line graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2022.113132openalex-snapshot
Spanning tree packing and 2-essential edge-connectivity
inferred← citeshttps://doi.org/10.1016/j.disc.2024.113921openalex-snapshot
Strongly even cycle decomposable non-planar line graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114443openalex-snapshot
The oriented diameter of graphs derived from other graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2004.03.013openalex-snapshot
Note on the connectivity of line graphs
inferred← citeshttps://doi.org/10.1016/j.jsc.2011.08.016openalex-snapshot
Cayley graphs and G -graphs: Some applications
inferred← citeshttps://doi.org/10.1016/j.patcog.2025.112507openalex-snapshot
Spectral compression transformer with line pose graph for monocular 3D human pose estimation
inferred← citeshttps://doi.org/10.1016/s0012-365x(02)00828-2openalex-snapshot
Edge-connectivity and super edge-connectivity of P2-path graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00029-5openalex-snapshot
On the line graphs of the complete r-partite graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00120-3openalex-snapshot
Cyclic and cliquewise connectedness of line graphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00197-xopenalex-snapshot
Connectivity of iterated line graphs
inferred← citeshttps://doi.org/10.1017/s0004972700041423openalex-snapshot
The connectivity of total graphs
inferred← citeshttps://doi.org/10.1051/ro/2024106openalex-snapshot
Realizability problem of distance-edge-monitoring numbers
inferred← citeshttps://doi.org/10.1088/1367-2630/18/11/113056openalex-snapshot
Coupled dynamics of node and link states in complex networks: a model for language competition
inferred← citeshttps://doi.org/10.1093/comjnl/bxab120openalex-snapshot
An Algorithm to Construct Completely Independent Spanning Trees in Line Graphs
inferred← citeshttps://doi.org/10.1093/comjnl/bxad126openalex-snapshot
Menger-Type Connectivity of Line Graphs of Generalized Hypercubes With Faulty Edges
inferred← citeshttps://doi.org/10.1103/physreve.89.062802openalex-snapshot
Fragmentation transition in a coevolving network with link-state dynamics
inferred← citeshttps://doi.org/10.1109/12.223681openalex-snapshot
Line digraph iterations and connectivity analysis of de Bruijn and Kautz graphs
inferred← citeshttps://doi.org/10.1109/lcsys.2018.2850921openalex-snapshot
Distributed Algorithms for Multi-Layer Connected Edge Dominating Sets
inferred← citeshttps://doi.org/10.1109/tcns.2022.3181797openalex-snapshot
Clock Rigidity and Joint Position-Clock Estimation in Ultrawideband Sensor Networks
inferred← citeshttps://doi.org/10.1109/tcsii.2017.2709300openalex-snapshot
Discrete-Time Positive Edge-Consensus for Undirected and Directed Nodal Networks
inferred← citeshttps://doi.org/10.1109/tnnls.2017.2728061openalex-snapshot
Observer-Based Discrete-Time Nonnegative Edge Synchronization of Networked Systems
inferred← citeshttps://doi.org/10.1109/tsmc.2017.2765678openalex-snapshot
Positive Edge Consensus of Complex Networks
inferred← citeshttps://doi.org/10.1142/s012962642650012xopenalex-snapshot
On the Extra Connectivity of the Power Graph of a Finite Cyclic Group
inferred← citeshttps://doi.org/10.21136/cmj.2021.0287-19openalex-snapshot
Generalized connectivity of some total graphs
inferred← citeshttps://doi.org/10.2139/ssrn.6102552openalex-snapshot
Optimal connectivity of second order iterated line graphs
inferred← citeshttps://doi.org/10.23919/ecc65951.2025.11186910openalex-snapshot
On the discrepancy between the task and communication graphs in multi-agent control systems
inferred← citeshttps://doi.org/10.3389/fcpxs.2023.1304448openalex-snapshot
Language dynamics within adaptive networks: an agent-based approach of nodes and links coevolution
inferred← citeshttps://doi.org/10.3390/math10203863openalex-snapshot
On a Combinatorial Approach to Studying the Steiner Diameter of a Graph and Its Line Graph
inferred← citeshttps://doi.org/10.4236/am.2021.127039openalex-snapshot
The Rupture Degree of k-Uniform Linear Hypergraph
inferred← citeshttps://doi.org/10.48550/arxiv.1112.0127openalex-snapshot
On the generalized (edge-)connectivity of graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1207.1838openalex-snapshot
A survey on the generalized connectivity of graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1603.03995openalex-snapshot
Path connectivity of line graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1604.06862openalex-snapshot
The minimal size of graphs with given pendant-tree connectivity
inferred← citeshttps://doi.org/10.48550/arxiv.1608.02055openalex-snapshot
The generalized 3-(edge) connectivity of total graphs
inferred← citeshttps://doi.org/10.5036/bfsiu1968.7.47openalex-snapshot
On the Connectivities of the Generalized Line, Middle and Total Graph
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.