Related papers: Universal graph series, chromatic functions, and t…
We focus on two specific generalizations of the chromatic symmetric function: one involving universal graphs and the other concerning vertex-weighted graphs. In this paper, we introduce a unified generalization that incorporates both…
In this paper, we introduce a generalized concept of vertex transitivity in graphs called generalized vertex transitivity. We put forward a new invariant called transitivity number of a graph. The value of this invariant in different…
To each colored graph, one can associate its closure in the universal space of isomorphism classes of pointed colored graphs, and this subspace can be regarded as a generalized subshift. Based on this correspondence, we extend the notion of…
Graph invariants provide a powerful analytical tool for investigation of abstract structures of graphs. They, combined in convenient relations, carry global and general information about a graph and its various substructures such as cycle…
This paper proposes a family of permutation-invariant graph embeddings, generalizing the Skew Spectrum of graphs of Kondor & Borgwardt (2008). Grounded in group theory and harmonic analysis, our method introduces a new class of graph…
Firstly, for a general graph, we find a recursion formula on the number of Hamiltonian cycles and one on cycles. By this result, we give some new polynomial invariants. Secondly, we give a condition to tell whether a polynomial defined by…
We characterise the slices of the category of graphs that are algebraically universal in terms of the structure of the slicing graph. In particular, we show that algebraic universality is obtained if, and only if, the slicing graph contains…
Causal graph dynamics are transformations over graphs that capture two important symmetries of physics, namely causality and homogeneity. They can be equivalently defined as continuous and translation invariant transformations or functions…
We suggest a combinatorial classification of metric filtrations in measure spaces; a complete invariant of such a filtration is its combinatorial scheme, a measure on the space of hierarchies of the group~$\mathbb Z$. In turn, the notion of…
We present a simple proof for the universality of invariant and equivariant tensorized graph neural networks. Our approach considers a restricted intermediate hypothetical model named Graph Homomorphism Model to reach the universality…
We consider the universality for the trace invariants of $c_1 N \times \cdots \times c_D N$ tensors with i.i.d. complex random elements. In the case $c_1 = \cdots = c_D$, Gurau derived the universality in the limit $N \to \infty$ by…
The unitary evolution maps in closed chaotic quantum graphs are known to have universal spectral correlations, as predicted by random matrix theory. In chaotic graphs with absorption the quantum maps become non-unitary. We show that their…
Let $X$ be a family of graphs and $X_n$ the set of $n$-vertex graphs in $X$. A graph $U^{(n)}$ containing all graphs from $X_n$ as induced subgraphs is called $n$-universal for $X$. Moreover, we say that $U^{(n)}$ is a proper $n$-universal…
Graph polynomials are deemed useful if they give rise to algebraic characterizations of various graph properties, and their evaluations encode many other graph invariants. Algebraic: The complete graphs $K_n$ and the complete bipartite…
By a finite type-graph we mean a graph whose set of vertices is the set of all $k$-subsets of $[n]=\{1,2,\ldots, n\}$ for some integers $n\ge k\ge 1$, and in which two such sets are adjacent if and only if they realise a certain order type…
We use the line digraph construction to associate an orthogonal matrix with each graph. From this orthogonal matrix, we derive two further matrices. The spectrum of each of these three matrices is considered as a graph invariant. For the…
This paper treats some basic points in general relativity and in its perturbative analysis. Firstly a systematic classification of global SO(n) invariants, which appear in the weak-field expansion of n-dimensional gravitational theories, is…
In this work, we try to enunciate the Total chromatic number of some Cayley graphs like the Cayley graph on Symmetric group, Alternating group, Dihedral group with respect to some generating sets and some other regular graphs.
In this dissertation, we explore the structure of inversion graphs of permutations--a class of graphs that naturally arises by representing each permutation as a graph, where vertices correspond to entries and edges encode inversions.…
A new complete invariant for acyclic graphs is presented