相关论文: Eigenvalues and Critical Groups of Adinkras

We characterize all graphs for which there are eigenvectors of the graph Laplacian having all their components in {-1,+1} or {-1,0,+ 1}. Graphs having eigenvectors with components in {-1,+1} are called bivalent and are shown to be the…

In this article we investigate normalized adjacency eigenvalues (simply normalized eigenvalues) and normalized adjacency energy of connected threshold graphs. A threshold graph can always be represented as a unique binary string. Certain…

Random graphs defined by an occurrence probability that is invariant under node aggregation have been identified recently in the context of network renormalization. The invariance property requires that edges are drawn with a specific…

Let $G$ be a finite group. A number of graphs with the vertex set $G$ have been studied, including the power graph, enhanced power graph, and commuting graph. These graphs form a hierarchy under the inclusion of edge sets, and it is useful…

The monography examines the problem of constructing a group of automorphisms of a graph. A graph automorphism is a mapping of a set of vertices onto itself that preserves adjacency. The set of such automorphisms forms a vertex group of a…

This paper explores interlacing inequalities in the Laplacian spectrum of signed cycles and investigates interlacing relationship between the spectrum of the net-Laplacian of a signed graph and its subgraph formed by removing a vertex…

In finite group theory, studying the prime graph of a group has been an important topic for almost the past half-century. Recently, prime graphs of solvable groups have been characterized in graph theoretical terms only. This now allows the…

Network scientists have shown that there is great value in studying pairwise interactions between components in a system. From a linear algebra point of view, this involves defining and evaluating functions of the associated adjacency…

Here we have investigated a few properties of the eigenvalues of normalized (geometric) graph Laplacian in different graphs. Preservation of eigenvalue 1 from a particular subgraph to the entire graph, the spectrum of the graph constructed…

Using graph theory based on Adinkras, we consider once again the study of extremal black branes in the framework of quantum information. More precisely, we propose a one to one correspondence between qubit systems, Adinkras and certain…

The eccentricity matrix of a simple connected graph is obtained from the distance matrix by only keeping the largest distances for each row and each column, whereas the remaining entries become zero. This matrix is also called the…

In the study of supersymmetry in one dimension, various works enumerate sets of generators of garden algebras $GR(d,N)$ (and equivalently, valise Adinkras) for special cases $N = d = 4$ and $N = d = 8$, using group-theoretic methods and…

Strongly regular graphs are regular graphs with a constant number of common neighbours between adjacent vertices, and a constant number of common neighbours between non-adjacent vertices. These graphs have been of great interest over the…

A metrized graph is a compact singular 1-manifold endowed with a metric. A given metrized graph can be modelled by a family of weighted combinatorial graphs. If one chooses a sequence of models from this family such that the vertices become…

We investigate multiplicative groups consisting entirely of singular alternating sign matrices (ASMs), and present several constructions of such groups. It is shown that every finite group is isomorphic to a group of singular ASMs, with a…

The nilpotence variety for extended supersymmetric quantum mechanics is a cone over a quadric in projective space. The pure spinor correspondence, which relates the description of off-shell supermultiplets to the classification of modules…

We study a functional, whose critical points couple Dirac-harmonic maps from surfaces with a two form. The critical points can be interpreted as coupling the prescribed mean curvature equation to spinor fields. On the other hand, this…

We study the algebraic connectivity (or second Laplacian eigenvalue) of token graphs, also called symmetric powers of graphs. The $k$-token graph $F_k(G)$ of a graph $G$ is the graph whose vertices are the $k$-subsets of vertices from $G$,…

A complex unit gain graph is a graph where each orientation of an edge is given a complex unit, which is the inverse of the complex unit assigned to the opposite orientation. We extend some fundamental concepts from spectral graph theory to…

An important facet of the inverse eigenvalue problem for graphs is to determine the minimum number of distinct eigenvalues of a particular graph. We resolve this question for the join of a connected graph with a path. We then focus on…