scientific article; zbMATH DE number 1952951

Publication date: 24 July 2003

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

automorphism group Cayley graph strongly regular graph reconstruction conjecture graphical regular representation

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (48)

Hoffman polynomials of nonnegative irreducible matrices and strongly connected digraphs ⋮ Orthogonal double covers of circulant graphs by corona product of certain infinite graph classes ⋮ Generalisations of hypomorphisms and reconstruction of hypergraphs ⋮ Perfect matching transitivity of circulant graphs. ⋮ Reconstruction of distance hereditary 2-connected graphs ⋮ \(C^{*}\)-subalgebras generated by a single operator in \(B(H)\) ⋮ An age-structured multi-strain epidemic model for antigenically diverse infectious diseases: a multi-locus framework ⋮ Unnamed Item ⋮ A note on non-reconstructible 3-hypergraphs ⋮ Complexity results in graph reconstruction ⋮ Unnamed Item ⋮ Concentric network symmetry ⋮ Degree lists and connectedness are 3-reconstructible for graphs with at least seven vertices ⋮ The size of a graph is reconstructible from any \(n-2\) cards ⋮ Combinatorial PDEs on Cayley and coset graphs ⋮ Unnamed Item ⋮ Numerical measures for two-graphs ⋮ Reconstruction and edge reconstruction of triangle-free graphs ⋮ Free probability on the limit \(C^\ast\)-algebra induced by a chain of graphs ⋮ Unnamed Item ⋮ On Semicircular Elements Induced by Connected Finite Graphs ⋮ Inferring a graph from path frequency ⋮ Links between two semisymmetric graphs on 112 vertices via association schemes ⋮ Symmetry in world trade network ⋮ \(G\)-graphs: a new representation of groups ⋮ \(K\)-groups of a \(C^\ast\)-algebra generated by a single operator ⋮ Symmetry in complex networks ⋮ Families of pairs of graphs with a large number of common cards ⋮ On the complexity of matrix reduction over finite fields ⋮ G-graphs: An efficient tool for constructing symmetric and semisymmetric graphs ⋮ \(C^{*}\)-algebras generated by partial isometries ⋮ A conjecture on the reconstruction of graphs from metric balls of their vertices ⋮ A NOTE ON EDGE-CONNECTIVITY OF THE CARTESIAN PRODUCT OF GRAPHS ⋮ Orthogonal double covers of Cayley graphs ⋮ THE INTERSECTION GRAPH OF GAMMA SETS IN THE TOTAL GRAPH OF A COMMUTATIVE RING-I ⋮ Uncountable families of vertex-transitive graphs of finite degree ⋮ A New Property of Hamming Graphs and Mesh of d-ary Trees ⋮ The robustness of LWPP and WPP, with an application to graph reconstruction ⋮ Distance hereditary graphs \(G\) of connectivity two or three and \(\operatorname{diam} (G) = \operatorname{diam} (\overline{G}) = 3\) are reconstructible ⋮ A reduction of the graph reconstruction conjecture ⋮ Applications of automata and graphs: Labeling operators in Hilbert space. II. ⋮ Deterministic walks with choice ⋮ Unnamed Item ⋮ The semicircular law of free probability as noncommutative multivariable operator theory ⋮ Applications of automata and graphs: Labeling-operators in Hilbert space. I ⋮ The symmetry-moderated Wiener index of truncation graph, thorn graph and caterpillars ⋮ Characterization of perfect matching transitive graphs ⋮ Tomography on Finite Graphs

Uses Software

This page was built for publication: