I-graphs and the corresponding configurations

DOI10.1002/jcd.20054zbMath1076.05065OpenAlexW2028428120MaRDI QIDQ5711784

Tomaž Pisanski, Marko Boben, Arjana Žitnik

Publication date: 8 December 2005

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jcd.20054

zbMATH Keywords

automorphism groupsisomorphismgeometric configurationsincidence structures

Mathematics Subject Classification ID

Other designs, configurations (05B30) Structural characterization of families of graphs (05C75)

Related Items (32)

On the odd girth and the circular chromatic number of generalized Petersen graphs ⋮ Counting spanning trees in cobordism of two circulant graphs ⋮ A class of highly symmetric graphs, symmetric cylindrical constructions and their spectra ⋮ Determining the edge metric dimension of the generalized Petersen graph \(P(n, 3)\) ⋮ On generalised Petersen graphs of girth 7 that have cop number 4 ⋮ On automorphisms of Haar graphs of abelian groups ⋮ On the reliability of generalized Petersen graphs ⋮ A classification of cubic bicirculants ⋮ Structural and computational results on platypus graphs ⋮ On the cop number of generalized Petersen graphs ⋮ Component connectivity of generalized Petersen graphs ⋮ Cubic edge-transitive bi-\(p\)-metacirculants ⋮ Isomorphism checking of \(I\)-graphs ⋮ Canonical double covers of generalized Petersen graphs, and double generalized Petersen graphs ⋮ \(GI\)-graphs: a new class of graphs with many symmetries ⋮ Chiral astral realizations of cyclic 3-configurations ⋮ Cubic vertex-transitive graphs admitting automorphisms of large order ⋮ Distinguishing graphs via cycles ⋮ A new generalization of generalized Petersen graphs ⋮ The isomorphism problem for rose window graphs ⋮ Cubic bi-Cayley graphs over abelian groups ⋮ On Jacobian group and complexity of I-graph I(n, k, l) through Chebyshev polynomials ⋮ The Number of Cyclic Configurations of Type (v₃) and the Isomorphism Problem ⋮ Most Generalized Petersen graphs of girth 8 have cop number 4 ⋮ Vertex-transitive expansions of (1, 3)-trees ⋮ Unnamed Item ⋮ Distance-balanced graphs: symmetry conditions ⋮ On the minimum vertex cover of generalized Petersen graphs ⋮ Bipartite edge-transitive bi-p-metacirculants ⋮ Splittable and unsplittable graphs and configurations ⋮ Counting rooted spanning forests in cobordism of two circulant graphs ⋮ Vertex domination of generalized Petersen graphs

Cites Work

• Small triangle-free configurations of points and lines
• A characterization of astral \((n_4)\) configurations

This page was built for publication: I-graphs and the corresponding configurations