相关论文: Orthogonal symmetric matrices and joins of graphs

In this paper, we introduce a matrix for a mixed graph, called the integrated adjacency matrix. This matrix uniquely determines a mixed graph, as long as the indices of the matrix are specified. Additionally, we associate an (undirected)…

We reconsider density matrices of graphs as defined in [quant-ph/0406165]. The density matrix of a graph is the combinatorial laplacian of the graph normalized to have unit trace. We describe a simple combinatorial condition (the "degree…

We use two variational techniques to prove upper bounds for sums of the lowest several eigenvalues of matrices associated with finite, simple, combinatorial graphs. These include estimates for the adjacency matrix of a graph and for both…

Let $\Gamma$ be a $G$-symmetric graph with vertex set $V$. We suppose that $V$ admits a $G$-partition $\mathcal{B} = \{ B_0, ... , B_b \}$, with parts of size $v$, and that the quotient graph induced on $\mathcal B$ is a complete graph of…

This paper deals with the problem of representing the matching independence system in a graph as the intersection of finitely many matroids. After characterizing the graphs for which the matching independence system is the intersection of…

Let H be an r-partite r-graph, all of whose sides have the same size n. Suppose that there exist two sides of H, each satisfying the following condition: the degree of each legal (r-1)-tuple contained in the complement of this side is…

Let $G = (V, E)$ be a graph. We define matrices $M(G; \alpha, \beta)$as $\alpha D + \beta A$, where $\alpha$, $\beta$ are real numbers such that $(\alpha, \beta) \neq (0, 0)$ and $D$ and $A$ are the diagonal matrix and adjacency matrix of…

A graph $G$ is \emph{equimatchable} if every maximal matching of $G$ has the same cardinality. We are interested in equimatchable graphs such that the removal of any edge from the graph preserves the equimatchability. We call an…

It is well known that a graph $G$ has a symmetric spectrum if and only if it is bipartite, a signed graph $\Gamma=(G,\sigma)$ has a symmetric spectrum if $G$ is bipartite. However, there exists a spectrally symmetric signed graph…

For a connected graph $G$ with order $n$, let $e(G)$ be the number of its distinct eigenvalues and $d$ be the diameter. We denote by $m_G(\mu)$ the eigenvalue multiplicity of $\mu$ in $G$. It is well known that $e(G)\geq d+1$, which shows…

Let $G$ be a graph with an adjacent matrix $A(G)$. The multiplicity of an arbitrary eigenvalue $\lambda$ of $A(G)$ is denoted by $m_\lambda(G)$. In \cite{Wong}, the author apply the Pater-Wiener Theorem to prove that if the diameter of $T$…

We investigate connections between the symmetries (automorphisms) of a graph and its spectral properties. Whenever a graph has a symmetry, i.e. a nontrivial automorphism $\phi$, it is possible to use $\phi$ to decompose any matrix…

A graph $G$ has the Perfect-Matching-Hamiltonian property (PMH-property) if for each one of its perfect matchings, there is another perfect matching of $G$ such that the union of the two perfect matchings yields a Hamiltonian cycle of $G$.…

A connected graph $G$ with at least two vertices is matching covered if each of its edges lies in a perfect matching. A matching covered graph is minimal if the removal of any edge results in a graph that is no longer matching covered. An…

Given two graphs G and H its 1-{\it join} is the graph obtained by taking the disjoint union of G and H and adding all the edges between a nonempty subset of vertices of G and a nonempty subset of vertices of H. In general, composition…

We prove some results concerning Alcuin number of graphs. First, we classify graphs which have unique minimum vertex cover. Then we present two necessary conditions for a graph to be of class two and show why one of them (condition on…

A path in an edge-colored graph is called proper if no two consecutive edges of the path receive the same color. For a connected graph $G$, the proper connection number $pc(G)$ of $G$ is defined as the minimum number of colors needed to…

Graphons $W$ can be used as stochastic models to sample graphs $G_n$ on $n$ nodes for $n$ arbitrarily large. A graphon $W$ is said to have the $H$-property if $G_n$ admits a decomposition into disjoint cycles with probability one as $n$…

The cycles are the only $2$-connected graphs in which any two nonadjacent vertices form a vertex cut. We generalize this fact by proving that for every integer $k\ge 3$ there exists a unique graph $G$ satisfying the following conditions:…

A graph $X$ is said to be a pattern polynomial graph if its adjacency algebra is a coherent algebra. In this study we will find a necessary and sufficient condition for a graph to be a pattern polynomial graph. Some of the properties of the…