相关论文: Endomorphisms of The Hamming Graph and Related Gra…

In this article, we study quantum automorphism groups of distance-transitive graphs. We show that the odd graphs, the Hamming graphs $H(n,3)$, the Johnson graphs $J(n,2)$ and the Kneser graphs $K(n,2)$ do not have quantum symmetry. We also…

An $(m, n)$-colored-mixed graph $G=(V, A_1, A_2,\cdots, A_m, E_1, E_2,\cdots, E_n)$ is a graph having $m$ colors of arcs and $n$ colors of edges. We do not allow two arcs or edges to have the same endpoints. A homomorphism from an…

For positive integers $n$ and $r$, we let $Q_n^r$ denote the $r$th power of the $n$-dimensional discrete hypercube graph, i.e., the graph with vertex-set $\{0,1\}^n$, where two 0-1 vectors are joined if they are Hamming distance at most $r$…

We study the derangement graph $\Gamma_n$ whose vertex set consists of all permutations of $\{1,\ldots,n\}$, where two vertices are adjacent if and only if their corresponding permutations differ at every position. It is well-known that…

Let N be a regular branched cover of a homology 3-sphere M with deck group G isomorphic to Z_2^d and branch set a trivalent graph Gamma; such a cover is determined by a coloring of the edges of Gamma with elements of G. For each index-2…

A finite graph $\Gamma$ is called $G$-symmetric if $G$ is a group of automorphisms of $\Gamma$ which is transitive on the set of ordered pairs of adjacent vertices of $\Gamma$. We study a family of symmetric graphs, called the unitary…

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…

Let $G = (V, E)$ be a graph and $\lambda $ a non-negative integer. A graph $G$ is called a $(\lambda, 1)$-{\em graph} if $ (c0)$ $G$ is neither a complete graph no an edge-empty graph, $ (c1)$ every edge in $G$ belongs to exactly $\lambda$…

We introduce a homotopy theory of digraphs (directed graphs) and prove its basic properties, including the relations to the homology theory of digraphs constructed by the authors in previous papers. In particular, we prove the homotopy…

A connected graph can be associated with two distinct evolution algebras. In the first case, the structural matrix is the adjacency matrix of the graph itself. In the second case, the structural matrix is the transition probabilities matrix…

A h-uniform hypergraph H=(V,E) is called (l,k)-orientable if there exists an assignment of each hyperedge e to exactly l of its vertices such that no vertex is assigned more than k hyperedges. Let H_{n,m,h} be a hypergraph, drawn uniformly…

In an $\mathsf{L}$-embedding of a graph, each vertex is represented by an $\mathsf{L}$-segment, and two segments intersect each other if and only if the corresponding vertices are adjacent in the graph. If the corner of each…

We characterize unicyclic graphs that are singular using the support of the null space of their pendant trees. From this, we obtain closed formulas for the independence and matching numbers of a unicyclic graph, based on the support of its…

For a given hypergraph $H$ and a vertex $v\in V(H)$, consider a random matching $M$ chosen uniformly from the set of all matchings in $H.$ In $1995,$ Kahn conjectured that if $H$ is a $d$-regular linear $k$-uniform hypergraph, the…

We give a complete classification of homomorphisms from the braid group on $n$ strands to the braid group on $2n$ strands when $n$ is at least 5. We also classify endomorphisms of the braid group on 4 strands, as well as homomorphisms from…

A mapping $\alpha : V(G) \to V(H)$ from the vertex set of one graph $G$ to another graph $H$ is an isometric embedding if the shortest path distance between any two vertices in $G$ equals the distance between their images in $H$. Here, we…

Let $G = (V,E)$ denote a simple graph with the vertex set $V$ and the edge set $E$. The profile of a vertex set $V'\subseteq V$ denotes the multiset of pairwise distances between the vertices of $V'$. Two disjoint subsets of $V$ are…

We investigate properties which ensure that a given finite graph is the commuting graph of a group or semigroup. We show that all graphs on at least two vertices such that no vertex is adjacent to all other vertices is the commuting graph…

Let $\Gamma$ be a connected regular graph with an eigenvalue $\lambda$ and corresponding idempotent $E_{\lambda}$. Let ${\cal E}_{\lambda}=\langle J,E_{\lambda}\rangle^\circ$ be the algebra generated by $J$ and $E_\lambda$ with respect to…

A sum graph is a finite simple graph whose vertex set is labeled with distinct positive integers such that two vertices are adjacent if and only if the sum of their labels is itself another label. The spum of a graph $G$ is the minimum…