Related papers: Vertex-primitive digraphs having vertices with alm…

Vertex similarity is a major problem in network science with a wide range of applications. In this work we provide novel perspectives on finding (dis)similar vertices within a network and across two networks with the same number of vertices…

Seymour's Second Neighborhood Conjecture asserts that every digraph (without digons) has a vertex whose first out-neighborhood is at most as large as its second out-neighborhood. It is proved for tournaments, tournaments missing a matching…

An internal or friendly partition of a vertex set $V(G)$ of a graph $G$ is a partition to two nonempty sets $A\cup B$ such that every vertex has at least as many neighbours in its own class as in the other one. Motivated by Diwan's…

Quasi-isometry is a measure of how similar two graphs are at `large-scale'. Nguyen, Scott, and Seymour [arXiv:2501.09839] and Hickingbotham [arXiv:2501.10840] independently gave a characterisation of graphs quasi-isometric to graphs of…

Given a set of nonempty subsets of some universal set, their intersection graph is defined as the graph with one vertex for each set and two vertices are adjacent precisely when their representing sets have non-empty intersection. Sometimes…

If $G$ is a finite group, then the spectrum $\omega(G)$ is the set of all element orders of $G$. The prime spectrum $\pi(G)$ is the set of all primes belonging to $\omega(G)$. A simple graph $\Gamma(G)$ whose vertex set is $\pi(G)$ and in…

The problem of measuring similarity of graphs and their nodes is important in a range of practical problems. There is a number of proposed measures, some of them being based on iterative calculation of similarity between two graphs and the…

The newly introduced neighborhood matrix extends the power of adjacency and distance matrices to describe the topology of graphs. The adjacency matrix enumerates which pairs of vertices share an edge and it may be summarized by the degree…

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…

We describe a construction for embeddings of complete graphs where the dual has a cutvertex and the genus is close to the minimum genus of the primal graph. When the number of vertices is congruent to 5 modulo 12, we further guarantee that…

For arbitrary semimetric space $(X, d)$ and disjoint proximinal subsets $A$, $B$ of $X$ we define the proximinal graph as a bipartite graph with parts $A$ and $B$ whose edges $\{a, b\}$ satisfy the equality $d(a, b) = \operatorname{dist}(A,…

Given a vertex-coloured graph, a dominating set is said to be tropical if every colour of the graph appears at least once in the set. Here, we study minimum tropical dominating sets from structural and algorithmic points of view. First, we…

Let $G=(V,E)$ be a simple graph and $(2k+1)$ be a prime integer. Let each vertex of $G$ be colored using one of the $(2k+1)$ colors, say $R_1,R_2,...,R_{2k+1}$. If every vertex has an equal number of neighbors of each color, then the…

A near-factor of a finite simple graph $G$ is a matching that saturates all vertices except one. A graph $G$ is said to be near-factor-critical if the deletion of any vertex from $G$ results in a subgraph that has a near-factor. We prove…

Consider a graph $G$ where each vertex is visibly labelled as a member of a distinct class, but also has a hidden binary state: wild or tame. Edges with end points in the same class are called agreement edges. Premise: an edge connecting…

A vertex in a graph is said to be sedentary if a quantum state assigned on that vertex tends to stay on that vertex. Under mild conditions, we show that the direct product and join operations preserve vertex sedentariness. We also…

We show that finitely presented groups which admit $k$-planar Cayley graphs contain finite-index subgroups with planar Cayley graphs. More generally, we answer a question of Georgakopoulos and Papasoglu in the special case of coarsely…

We show that the pair given by the power set and by the "Grassmannian"(set of all subgroups) of an arbitrary group behaves very much like the pair given by a projective space and its dual projective space. More precisely, we generalize…

A main result in this paper is the proof that proximal Vorono\"{i} regions are convex polygons. In addition, it is proved that every collection of proximal Vorono\"{i} regions has a Leader uniform topology.

A successive vertex ordering of a graph is a linear ordering of its vertices in which every vertex except the first has at least one neighbour appearing earlier. Such orderings arise naturally in incremental growth and…