Related papers: Mutual-visibility problems on graphs of diameter t…
For a graph $G$, a function $\psi$ is called a \emph{bar visibility representation} of $G$ when for each vertex $v \in V(G)$, $\psi(v)$ is a horizontal line segment (\emph{bar}) and $uv \in E(G)$ iff there is an unobstructed, vertical,…
A vertex $w$ of a connected graph $G$ strongly resolves two vertices $u,v\in V(G)$, if there exists some shortest $u-w$ path containing $v$ or some shortest $v-w$ path containing $u$. A set $S$ of vertices is a strong metric generator for…
In this paper we consider the degree/diameter problem, namely, given natural numbers {\Delta} \geq 2 and D \geq 1, find the maximum number N({\Delta},D) of vertices in a graph of maximum degree {\Delta} and diameter D. In this context, the…
In this study we are interested mainly in investigating the relations between two graph irregularity measures which are widely used for structural irregularity characterization of connected graphs. Our study is focused on the comparison and…
The NP-hard general factor problem asks, given a graph and for each vertex a list of integers, whether the graph has a spanning subgraph where each vertex has a degree that belongs to its assigned list. The problem remains NP-hard even if…
Let $X$ be a finite, simple graph with vertex set $V(X)$. The $2$-distance graph $T_2(X)$ of $X$ is the graph with the same vertex set as $X$ and two vertices are adjacent if and only if their distance in $X$ is exactly $2$. A graph $G$ is…
A graph $G=(V,E)$ is a {\it unipolar graph} if there exits a partition $V=V_1 \cup V_2$ such that, $V_1$ is a clique and $V_2$ induces the disjoint union of cliques. The complement-closed class of {\it generalized split graphs} are those…
The complexity of the graph isomorphism problem for trapezoid graphs has been open over a decade. This paper shows that the problem is GI-complete. More precisely, we show that the graph isomorphism problem is GI-complete for comparability…
Let $G$ and $H$ be two simple graphs. A bijection $\phi:V(G)\rightarrow V(H)$ is called an isomorphism between $G$ and $H$ if $(\phi v_i)(\phi v_j)\in E(H)$ $\Leftrightarrow$ $v_i v_j\in E(G)$, $\forall v_i,v_j \in V(G)$. In the case that…
A graph is Cartesian decomposable if it is isomorphic to a Cartesian product of (more than one) strictly smaller graphs, each of which has more than one vertex and admits no such decomposition. These smaller graphs are called the…
For two graphs $X$ and $Y$ with vertex sets $V(X)$ and $V(Y)$ of the same cardinality $n,$ the friends-and-strangers graph $\mathsf{FS}(X,Y)$ was recently defined by Defant and Kravitz. The vertices of $\mathsf{FS}(X,Y)$ are the bijections…
Perhaps the very first elementary exercise one encounters in graph theory is the result that any graph on at least two vertices must have at least two vertices with the same degree. There are various ways in which this result can be…
One of the central topics in extremal graph theory is the study of the function $ex(n,H)$, which represents the maximum number of edges a graph with $n$ vertices can have while avoiding a fixed graph $H$ as a subgraph. Tur{\'a}n provided a…
Given a combinatorial structure, a ``twin'' is a pair of disjoint substructures which are isomorphic (or look the same in some sense). In recent years, there have been many problems about finding large twins in various combinatorial…
A set $D$ of vertices in a graph $G$ is a dominating set if every vertex of $G$, which is not in $D$, has a neighbor in $D$. A set of vertices $D$ in $G$ is convex (respectively, isometric), if all vertices in all shortest paths…
We study the two-player communication problem of determining whether two vertices $x, y$ are nearby in a graph $G$, with the goal of determining the graph structures that allow the problem to be solved with a constant-cost randomized…
It has long been known that a vertex-transitive graph $\Gamma$ is isomorphic to a double coset graph $\text{Cos}(G,H,S)$ of a transitive group $G\le\text{Aut}(\Gamma)$, a vertex stabilizer $H\le G$, and some subset $S\subseteq G$. We show…
In the Matching Cut problem we ask whether a graph $G$ has a matching cut, that is, a matching which is also an edge cut of $G$. We consider the variants Perfect Matching Cut and Disconnected Perfect Matching where we ask whether there…
Mixed graphs can be seen as digraphs that have both arcs and edges (or digons, that is, two opposite arcs). In this paper, we consider the case in which such graphs are Cayley graphs of Abelian groups. These groups can be constructed by…
In this paper, we consider the following two problems: (i) Deletion Blocker($\alpha$) where we are given an undirected graph $G=(V,E)$ and two integers $k,d\geq 1$ and ask whether there exists a subset of vertices $S\subseteq V$ with…