Results 51 to 60 of about 18,175 (189)
The Weisfeiler-Leman algorithm and the diameter of Schreier graphs
, 2018 We prove that the number of iterations taken by the Weisfeiler-Leman algorithm for configurations coming from Schreier graphs is closely linked to the diameter of the graphs themselves: an upper bound is found for general Schreier graphs, and a lower ...
Dona, Daniele
core +1 more source
Discrete Mathematics, 1992 The autors introduce the concept of generalized Cayley graph. The main result is that if \(X\) is a graph, \(B(X)\) its double covering then \(B(X)\) is a Cayley graph if and only if \(X\) is a generalized Cayley graph. Another result is that a generalized Cayley graph that is stable is a Cayley graph. Furthermore a construction is given of a family of
MARUSIC D. +2 more
openaire +3 more sources
Edge‐Length Preserving Embeddings of Graphs Between Normed Spaces
Journal of Graph Theory, EarlyView.ABSTRACT The concept of graph embeddability, initially formalized by Belk and Connelly and later expanded by Sitharam and Willoughby, extends the question of embedding finite metric spaces into a given normed space. A finite simple graph G = ( V , E ) $G=(V,E)$ is said to be ( X , Y ) $(X,Y)$‐embeddable if any set of induced edge lengths from an ...
Sean Dewar +3 more
wiley +1 more source
On the Eigenvalue Spectrum of Cayley Graphs: Connections to Group Structure and Expander Properties
MathematicsCayley graphs sit at the intersection of algebra, geometry, and theoretical computer science. Their spectra encode fine structural information about both the underlying group and the graph itself.
Mohamed A. Abd Elgawad +4 more
doaj +1 more source
Signed Projective Cubes, a Homomorphism Point of View
Journal of Graph Theory, EarlyView.ABSTRACT The (signed) projective cubes, as a special class of graphs closely related to the hypercubes, are on the crossroad of geometry, algebra, discrete mathematics and linear algebra. Defined as Cayley graphs on binary groups, they represent basic linear dependencies.
Meirun Chen +2 more
wiley +1 more source
Journal of MathematicsSymmetry properties are of vital importance for graphs. The famous Cayley graph is a good mathematical model as its high symmetry. The normality of the graph can well reflect the symmetry of the graph.
Li Wang, Xiaohan Ye, Weihua Yang
doaj +1 more source
Unitary Cayley graphs of Dedekind domain quotients
AKCE International Journal of Graphs and Combinatorics, 2016 If X is a commutative ring with unity, then the unitary Cayley graph of X, denoted GX, is defined to be the graph whose vertex set is X and whose edge set is {{a,b}:a−b∈X×}.
Colin Defant
doaj +1 more source
A Coarse Geometric Approach to Graph Layout Problems
Journal of Graph Theory, EarlyView.ABSTRACT We define a range of new coarse geometric invariants based on various graph–theoretic measures of complexity for finite graphs, including treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these invariants can be used to define functions which satisfy a strong monotonicity property, namely, they are ...
Wanying Huang +3 more
wiley +1 more source
Coloring minimal Cayley graphs
European Journal of Combinatorics9 pages, 1 ...
García Marco, Ignacio, Knauer, Kolja
openaire +4 more sources
Strongly Regular Semi-Cayley Graphs [PDF]
Journal of Algebraic Combinatorics, 1992 This paper studies strongly regular graphs \(G\) on \(2n\) vertices which admit a group of automorphisms \(\Gamma\) of order \(n\) with two orbits of length \(n\) on the vertices of \(G\), which are called semi-Cayley graphs. The Petersen and Hoffman-Singleton graphs provide examples.
de Resmini, Marialuisa J. +1 more
openaire +3 more sources