相关论文: Derangement action digraphs and graphs

We characterize connected tetravalent graphs $\Gamma$ which admit groups $M<H$ of automorphisms such that $\Gamma$ is $M$-half-arc-transitive and $H$-arc-transitive. Examples for each case are constructed, including a counter-example to a…

A graph $G$ of order $2n$ is called degree-equipartite if for every $n$-element set $A\subseteq V(G)$, the degree sequences of the induced subgraphs $G[A]$ and $G[V(G)\setminus A]$ are the same. In this paper, we characterize all…

The paper gives a thorough introduction to spectra of digraphs via its Hermitian adjacency matrix. This matrix is indexed by the vertices of the digraph, and the entry corresponding to an arc from $x$ to $y$ is equal to the complex unity…

A digraph $D=(V, A)$ has a good pair at a vertex $r$ if $D$ has a pair of arc-disjoint in- and out-branchings rooted at $r$. Let $T$ be a digraph with $t$ vertices $u_1,\dots , u_t$ and let $H_1,\dots H_t$ be digraphs such that $H_i$ has…

For a subset $ S $ of $ \mathbb R^d$, $ S$-graphs are the intersection graphs of specific transformations of $ S $. The class of Burling graphs is a class of triangle-free graphs with arbitrarily large chromatic number that has attracted…

There are a variety of ways to associate directed or undirected graphs to a group. It may be interesting to investigate the relations between the structure of these graphs and characterizing certain properties of the group in terms of some…

Efficiency of routing on a regular digraph often involves finding opitmal properties of the graph. For example, the diameter of a digraph is the maximum distance between any two vertices. We show how we can study these problems…

We tackle the problem of attributed graph transformations and propose a new algorithmic approach for defining parallel graph transformations allowing overlaps. We start by introducing some abstract operations over graph structures. Then, we…

Compound graphs are networks in which vertices can be grouped into larger subsets, with these subsets capable of further grouping, resulting in a nesting that can be many levels deep. In several applications, including biological workflows,…

Over recent years there has been much interest in both Tur\'an and Ramsey properties of vertex ordered graphs. In this paper we initiate the study of embedding spanning structures into vertex ordered graphs. In particular, we introduce a…

In this paper, we introduce the notion of the containment graph of a family of sets and containment classes of graphs and posets. Let $Z$ be a family of nonempty sets. We call a (simple, finite) graph G = (V, E) a $Z$-containment graph…

Anomaly analytics is a popular and vital task in various research contexts, which has been studied for several decades. At the same time, deep learning has shown its capacity in solving many graph-based tasks like, node classification, link…

Let $X$ be a finite set and let $\mathsf{Mat}_X(\mathbb{C})$ denote the algebra of matrices with rows and columns indexed by $X$ and entries from the complex numbers acting on $\mathbb{C}^X$ with standard basis $\{ \hat{x} \mid x\in X\}$.…

A Cayley graph $\Ga=\Cay(G,S)$ is said to be normal if $G$ is normal in $\Aut\Ga$. The concept of normal Cayley graphs was first proposed by M.Y.Xu in [Discrete Math. 182, 309-319, 1998] and it plays an important role in determining the…

This paper introduces a notion of presentation for locally inverse semigroups and develops a graph structure to describe the elements of locally inverse semigroups given by these presentations. These graphs will have a role similar to the…

Let $G$ be a simple graph, $A(G)$ its adjacency matrix, and $D(G)$ its diagonal degree matrix. In 2022, \citeauthor{Wang2020} (\cite{Wang2020}) defined the family of matrices $L_\alpha$ as the convex linear combination: \[ L_\alpha(G) =…

We view hyper-graphs as incidence graphs, i.e. bipartite graphs with a set of nodes representing vertices and a set of nodes representing hyper-edges, with two nodes being adjacent if the corresponding vertex belongs to the corresponding…

We introduce the notion of an \emph{$n$-dimensional mixed dihedral group}, a general class of groups for which we give a graph theoretic characterisation. In particular, if $H$ is an $n$-dimensional mixed dihedral group then the we…

Random intersection graphs have received much interest and been used in diverse applications. They are naturally induced in modeling secure sensor networks under random key predistribution schemes, as well as in modeling the topologies of…

This paper studies the problem of detecting anomalous graphs using a machine learning model trained on only normal graphs, which has many applications in molecule, biology, and social network data analysis. We present a self-discriminative…