相关论文: The spectra of generalized Paley graphs of $(q^\el…
Graph Neural Networks (GNN) are inherently limited in their expressive power. Recent seminal works (Xu et al., 2019; Morris et al., 2019b) introduced the Weisfeiler-Lehman (WL) hierarchy as a measure of expressive power. Although this…
Let $F(x)=(f_1(x), \dots, f_m(x))$ be such that $1, f_1, \dots, f_m$ are linearly independent polynomials with real coefficients. Based on ideas of Bachoc, DeCorte, Oliveira and Vallentin in combination with estimating certain oscillatory…
We characterize the set of planar locally finite Cayley graphs, and give a finite representation of these graphs by a special kind of finite state automata called labeling schemes. As a result, we are able to enumerate and describe all…
Conjecturally, almost all graphs are determined by their spectra. This problem has also been studied for variants such as the spectra of the Laplacian and signless Laplacian. Here we consider the problem of determining graphs with Ihara and…
In this paper, we determine the Randic' energy of the m-splitting graph, the m-shadow graph and the m-duplicate graph of a given graph, m being an arbitrary integer. Our results allow the construction of an infinite sequence of graphs…
We study the connectivity of proper power graphs of some family of finite groups including nilpotent groups, groups with a non-trivial partition, and symmetric and alternating groups.
In this paper, firstly, we provide some necessary and sufficient conditions for generalized Cayley graphs on abelian groups to be bipartite. Secondly, we deduce several necessary and sufficient conditions for generalized Cayley graphs on…
We investigate the spectral properties of chaotic quantum graphs. We demonstrate that the `energy'--average over the spectrum of individual graphs can be traded for the functional average over a supersymmetric non--linear $\sigma$--model…
The main purpose of this paper is to introduce and investigate a class of generalized Bernoulli polynomials and Euler polynomials based on the generating function. we unify all forms of q-exponential functions by one more parameter. we…
Applying a method of Godsil and McKay \cite{GM} to some graphs related to the symplectic graph, a series of new infinite families of strongly regular graphs with parameters…
We survey some of the known results on eigenvalues of Cayley graphs and their applications, together with related results on eigenvalues of Cayley digraphs and generalizations of Cayley graphs.
In a previous paper of the first author a procedure was developed for counting the components of a graph through the knowledge of the components of its quotient graphs. We apply here that procedure to the proper power graph…
We present significant evidence that the powerful property of Yangian invariance extends to a new large class of conformally invariant Feynman integrals. Our results apply to planar Feynman diagrams in any spacetime dimension dual to an…
Quadratic programming (QP) is the most widely applied category of problems in nonlinear programming. Many applications require real-time/fast solutions, though not necessarily with high precision. Existing methods either involve matrix…
This article lays the foundations for an analogue of geometric group theory that studies actions on graphs by right quasigroups, including racks and quandles. We study markings of graphs that realize racks, and we introduce (di)graph…
Gcd-graphs over the ring of integers modulo $n$ are a natural generalization of unitary Cayley graphs. The study of these graphs has foundations in various mathematical fields, including number theory, ring theory, and representation…
An operation on species corresponding to the inner plethysm of their associated cycle index series is constructed. This operation, the inner plethysm of species, is generalized to n-sorted species. Polynomial maps on species are studied and…
In this paper we define the (edge-weighted) Cayley graph associated to a generalized Boolean function, introduce a notion of strong regularity and give several of its properties. We show some connections between this concept and generalized…
Using a Cayley complex (generalizing the Cayley graph) and Clifford algebras, we are able to give, for a large class of finitely presented groups, a uniform construction of spectral triples with $D_{+}$ of index 1.
Let G be a finite group with identity e and H \neq \{e\} be a subgroup of G. The generalized non-coprime graph GAmma_{G,H} of G with respect to H is the simple undirected graph with G - \{e \}\) as the vertex set and two distinct vertices a…