Related papers: Equitable 2-partitions of Johnson graphs with the …
In graph theory a partition of the vertex set of a graph is called equitable if for all pairs of cells all vertices in one cell have an equal number of neighbours in the other cell. Considering the implications for the adjacency matrix one…
In this note we consider $W$-shaped map $W_0=W_{s_1,s_2}$ with $\frac {1}{s_1}+\frac {1}{s_2}=1$ and show that eigenvalue 1 is not stable. We do this in a constructive way. For each perturbing map $W_a$ we show the existence of the "second"…
Let $G_w$ be a weighted graph. The number of the positive, negative and zero eigenvalues in the spectrum of $G_w$ are called positive inertia index, negative inertia index and nullity of $G_w$, and denoted by $i_{+}(G_w)$, $i_{-}(G_w)$,…
In this note, we consider locally invertible analytic mappings in two dimensions, with coefficients in a non-archimedean field. Suppose such a map has a Jacobian with eigenvalues $\lambda_1$ and $\lambda_2$ so that $|\lambda_1|>1$ and…
In this paper, we consider the Hessian matrices $H_{\Gamma}$ of the complete and complete bipartite graphs, and the special value of $\tilde H_{\Gamma}$ at $x_{i}=1$ for all $x_{i}$. We compute the eigenvalues of $\tilde H_{\Gamma}$. We…
We review the properties of eigenvectors for the graph Laplacian matrix, aiming at predicting a specific eigenvalue/vector from the geometry of the graph. After considering classical graphs for which the spectrum is known, we focus on…
This paper presents the applications of Eigenvalues and Eigenvectors (as part of spectral decomposition) to analyze the bipartivity index of graphs as well as to predict the set of vertices that will constitute the two partitions of graphs…
A number of recent papers have considered signed graph Laplacians, a generalization of the classical graph Laplacian, where the edge weights are allowed to take either sign. In the classical case, where the edge weights are all positive,…
Let $K$ be a field (finite or infinite) of char$(K)\neq 2$ and let $UT_n=UT_n(K)$ be the $n\times n$ upper triangular matrix algebra over $K$. If $\cdot $ is the usual product on $UT_n$ then with the new product $a\circ b=(1/2)(a\cdot b…
The problem of multiway partitioning of an undirected graph is considered. A spectral method is used, where the k > 2 largest eigenvalues of the normalized adjacency matrix (equivalently, the k smallest eigenvalues of the normalized graph…
In this paper, we explore the concept of the ``matrix product of graphs," initially introduced by Prasad, Sudhakara, Sujatha, and M. Vinay. This operation involves the multiplication of adjacency matrices of two graphs with assigned labels,…
The Jordan algebra of the symmetric matrices of order two over a field $K$ has two natural gradings by $\mathbb{Z}_2$, the cyclic group of order 2. We describe the graded polynomial identities for these two gradings when the base field is…
We study the problem of partitioning the edge set of the complete graph into bipartite subgraphs under certain constraints defined by forbidden subgraphs. These constraints lead to both classical problems, such as partitioning into…
The scaled standard Wigner matrix (symmetric with mean zero, variance one i.i.d. entries), and its limiting eigenvalue distribution, namely the semi-circular distribution, has attracted much attention. The $2k$th moment of the limit equals…
We relate Liouville/Toda CFT correlators on Riemann surfaces with boundaries and cross-cap states to supersymmetric observables in four-dimensional N=2 gauge theories. Our construction naturally involves four-dimensional theories with…
For an integer $n\geq 2$, the triangular graph has vertex set the $2$-subsets of $\{1,\ldots,n\}$ and edge set the pairs of $2$-subsets intersecting at one point. Such graphs are known to be halved graphs of bipartite rectagraphs, which are…
The regular embeddings of complete bipartite graphs $K_{n,n}$ in orientable surfaces are classified and enumerated, and their automorphism groups and combinatorial properties are determined. The method depends on earlier classifications in…
Given an arbitrary connected $G$, the $n$-polygon graph $\tau_n(G)$ is obtained by adding a path with length $n$ $(n\geq 2)$ to each edge of graph $G$, and the iterated $n$-polygon graphs $\tau_n^g(G)$ ($g\geq 0$), is obtained from the…
A symmetric doubly stochastic matrix A is said to be determined by its spectra if the only symmetric doubly stochastic matrices that are similar to A are of the form $P^TAP$ for some permutation matrix P. The problem of characterizing such…
Finding a new mathematical representations for graph, which allows direct comparison between different graph structures, is an open-ended research direction. Having such a representation is the first prerequisite for a variety of machine…