相关论文: Graphs of unitary matrices

A shape visibility representation displays a graph so that each vertex is represented by an orthogonal polygon of a particular shape and for each edge there is a horizontal or vertical line of sight between the polygons assigned to its…

A graph is called 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, we establish a local property of 1-planar graphs which describes the structure in the neighborhood of small…

Let $M$ be a graph manifold containing a single JSJ torus $T$ and whose JSJ blocks are of the form $\Sigma \times S^1$, where $\Sigma$ is a compact orientable surface with boundary. We show that if $M$ does not admit a Riemannian metric of…

The traditional adjacency matrix of a mixed graph is not symmetric in general, hence its eigenvalues may be not real. To overcome this obstacle, several authors have recently defined and studied various Hermitian adjacency matrices of…

If $M$ is a set of nonsingular $k\times k$ matrices then for many pairs of matrices, $A,B\in M,$ the sum is nonsingular, $\det(A+B)\neq 0.$ We prove a more general statement on nonsingular sums with an application.

Let $T$ be a digraph with vertices $u_1, \dots, u_t$ ($t\ge 2$) and let $H_1, \dots, H_t$ be digraphs such that $H_i$ has vertices $u_{i,j_i},\ 1\le j_i\le n_i.$ Then the composition $Q=T[H_1, \dots, H_t]$ is a digraph with vertex set…

A graph is called a strong (resp. weak) bar 1-visibility graph if its vertices can be represented as horizontal segments (bars) in the plane so that its edges are all (resp. a subset of) the pairs of vertices whose bars have a…

A matchstick graph is a graph drawn with straight edges in the plane such that the edges have unit length, and non-adjacent edges do not intersect. We call a matchstick graph $(m;n)$-regular if every vertex has only degree $m$ or $n$. In…

We introduce a concept of similarity between vertices of directed graphs. Let G_A and G_B be two directed graphs. We define a similarity matrix whose (i, j)-th real entry expresses how similar vertex j (in G_A) is to vertex i (in G_B. The…

Let $G$ be a group. The directed endomorphism graph, $\dend(G)$ of $G$ is a directed graph with vertex set $G$ and there is a directed edge from the vertex $a$ to the vertex $b$ if $a \neq b$ and there exists an endomorphism on $G$ mapping…

Let $M = (m_{ij})$ be an $n \times n$ square matrix of integers. For our purposes, we can assume without loss of generality that $M$ is homogeneous and that the entries are non-increasing going leftward and downward. Let $d$ be the sum of…

An independent set $I$ in a graph $G$ is maximal if $I$ is not properly contained in any other independent set of $G$. The study of maximal independent sets (MIS's) in various graphs is well-established, often focusing upon enumeration of…

For a directed acyclic graph, there are two known criteria to decide whether any specific conditional independence statement is implied for all distributions factorized according to the given graph. Both criteria are based on special types…

The vertex-edge incidence matrix of a (connected) unicyclic graph G is a square matrix which is invertible if and only if the cycle of G is an odd cycle. A combinatorial formula of the inverse of the incidence matrix of an odd unicyclic…

Given a graph $G$ then a subgraph $H$ is $isometric$ if, for every pair of vertices $u,v$ of $H$, we have $d_H(u,v) = d_G(u,v)$. We say a graph $G$ is $distance\ preserving\ (dp)$ if it has an isometric subgraph of every possible order up…

The Hamming graph $H(n,q)$ is the graph whose vertices are the words of length $n$ over the alphabet $\{0,1,\ldots,q-1\}$, where two vertices are adjacent if they differ in exactly one coordinate. The adjacency matrix of $H(n,q)$ has $n+1$…

A subset $M$ of the edge set of a graph $G$ is an induced matching of $G$ if given any two $e_1,e_2 \in M$, none of the vertices on $e_1$ is adjacent to any of the vertices on $e_2$. Suppose that $MIM_G$, a positive integer, is the largest…

Let $G$ be a simple graph. In 1986, Herbert Wilf asked what kind of graphs have an eigenvector with entries formed only by $\pm 1$? In this paper, we answer this question for the adjacency, Laplacian and signless Laplacian matrix of a…

The inclusion ideal graph of a commutative unitary ring $R$ is the (undirected) graph $In(R)$ whose vertices all non-trivial ideals of $R$ and two distinct vertices are adjacent if and only if one of them is a proper subset of the other…

The joint degree matrix of a graph gives the number of edges between vertices of degree i and degree j for every pair (i,j). One can perform restricted swap operations to transform a graph into another with the same joint degree matrix. We…