scientific article

Publication date: 1978

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

eigenvalues Hamiltonian connectivity root system homomorphism line graph line digraph Eulerian

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph theory (05C99) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items

Hoffman polynomials of nonnegative irreducible matrices and strongly connected digraphs, Enriched line graph: a new structure for searching language collocations, Spanners of underlying graphs of iterated line digraphs, On induced subgraphs with odd degrees, \(n\)-dimensional line digraphs, On some complexity properties of N-free posets and posets with bounded decomposition diameter, Containment of butterflies in networks constructed by the line digraph operation, Telegraph systems on networks and port-Hamiltonians. II: Network realizability, Bounds on the connectivity of iterated line graphs, Graphs \(G\) in which \(G-N[v\) has a prescribed property for each vertex \(v\)], The first zagreb index and some hamiltonian properties of the line graph of a graph, The VC-dimension of set systems defined by graphs, Hamiltonicity of complements of middle graphs, Digraphs on permutations, Color-line and proper color-line graphs, Polyhedral characterizations and perfection of line graphs, Parallel \(N\)-free order recognition, Line graphs for a multiplex network, On stable cutsets in line graphs, Rainbow connections of graphs: a survey, VC-dimensions for graphs (extended abstract), Graphs with the unique path property: Structure, cycles, factors, and constructions, The structure and dynamics of networks with higher order interactions, Incidence matrices and line graphs of mixed graphs, Line digraphs and the Moore-Penrose inverse, EVENT GRAPHS: ADVANCES AND APPLICATIONS OF SECOND-ORDER TIME-UNFOLDED TEMPORAL NETWORK MODELS, On commutativity of two unary digraph operations: subdividing and line-digraphing, Heredity of the index of convergence of the line digraph, Independence and upper irredundance in claw-free graphs, Asymptotic enumeration of N-free partial orders, Uniformly finite-to-one and onto extensions of homomorphisms between strongly connected graphs, Connection digraphs and second-order line digraphs, A labeling algorithm to recognize a line digraph and output its root graph, Unnamed Item, Automorphism groups of \(k\)-arc transitive covers., On stable cutsets in claw-free graphs and planar graphs, On neighbourhood line graphs, An incremental polynomial time algorithm to enumerate all minimal edge dominating sets, On several symmetry conditions for graphs, Semigroup approach to diffusion and transport problems on networks, The underlying graph of a line digraph, A note on certain de Bruijn sequences with forbidden subsequences, Isomorphisms of \(P_{k}\)-graphs for \(k \geqslant 4\), Infinite families of non-Cayley vertex-transitive tournaments, Diameter, short paths and superconnectivity in digraphs, On arc-regular permutation groups using Latin squares, Basic perfect graphs and their extensions, On the edges’ PageRank and line graphs, Essential edge connectivity of line graphs, On the determination problem for \(P_{4}\)-transformation of graphs, Some inequalities for the first general Zagreb index of graphs and line graphs, Computation and algorithm for the minimum \(k\)-edge-connectivity of graphs, Diameter and connectivity of 3-arc graphs, On a problem of walks, On endo-Cayley digraphs: the Hamiltonian property, Miscellaneous Digraph Classes, When a digraph and its line digraph are connected and cospectral, Line digraphs and coreflexive vertex sets, Review of properties of different precedence graphs for scheduling problems, Line graphs and forbidden induced subgraphs, 9-connected claw-free graphs are Hamilton-connected, Minimizing the jump number for partially ordered sets: A graph-theoretic approach, Graphoidal graphs and graphoidal digraphs: a generalization of line graphs, On \(\bullet\)-line signed graphs \(L_\bullet(S)\), A survey of line digraphs and generalizations, Some transport and diffusion processes on networks and their graph realizability, Optimal constructions of reversible digraphs, On hamiltonian line graphs and connectivity, Three-arc graphs: characterization and domination