相关论文: A new condition on dominated pair degree sum for a…

A digraph $D$ with a subset $S$ of $V(D)$ is called $\boldsymbol{S}${\bf -strong} if for every pair of distinct vertices $u$ and $v$ of $S$, there is a $(u, v)$-dipath and a $(v, u)$-dipath in $D$. We define a digraph $D$ with a subset $S$…

For a graph $G$, the vertices of the $k$-dominating graph, denoted $\mathcal{D}_k(G)$, correspond to the dominating sets of $G$ with cardinality at most $k$. Two vertices of $\mathcal{D}_k(G)$ are adjacent if and only if the corresponding…

An out-branching $B^+_u$ (in-branching $B^-_u$) in a digraph $D$ is a connected spanning subdigraph of $D$ in which every vertex except the vertex $u$, called the root, has in-degree (out-degree) one. A {\bf good $\mathbf{(u,v)}$-pair} in…

We prove two sharp sufficient conditions for hamiltonian cycles in balanced bipartite directed graph. Let $D$ be a strongly connected balanced bipartite directed graph of order $2a$. Let $x,y$ be distinct vertices in $D$. $\{x,y\}$…

Given a graph G = (V,E), a subset S of V is dominating if for every v in V - S there exists u in S such that uv is in E. A dominating subset S of V is secure if for every v in V - S there exists u in S such that (S - {u}) U {v} is…

A digraph is eulerian if it is connected and every vertex has its in-degree equal to its out-degree. Having a spanning eulerian subdigraph is thus a weakening of having a hamiltonian cycle. In this paper, we first characterize the pairs…

A graph $G$ is a $D\!D_2$-graph if it has a pair $(D,D_2)$ of disjoint sets of vertices of $G$ such that $D$ is a dominating set and $D_2$ is a 2-dominating set of $G$. We provide several characterizations and hardness results concerning…

We describe a new type of sufficient condition for a balanced bipartite digraph to be hamiltonian. Let $D$ be a balanced bipartite digraph and $x,y$ be distinct vertices in $D$. $\{x, y\}$ dominates a vertex $z$ if $x\rightarrow z$ and…

A subset $D\subseteq V_G$ is a dominating set of $G$ if every vertex in $V_G-D$ has a~neighbor in $D$, while $D$ is a paired-dominating set of $G$ if $D$ is a~dominating set and the subgraph induced by $D$ contains a perfect matching. A…

A subset $D\subseteq V_G$ is a dominating set of $G$ if every vertex in $V_G\setminus D$ has a neighbor in $D$, while $D$ is a 2-dominating set of $G$ if every vertex belonging to $V_G\setminus D$ is joined by at least two edges with a…

A digraph $D$ is called {\bf noneven} if it is possible to assign weights of 0,1 to its arcs so that $D$ contains no cycle of even weight. A noneven digraph $D$ corresponds to one or more nonsingular sign patterns. Given an $n \times n$…

We prove several new sufficient conditions for hamiltonicity and bipancyclicity in balanced bipartite digraphs, in terms of sums of degrees over dominating or dominated pairs of vertices.

A graph $G=(V(G), E(G))$ is supereulerian if it has a spanning Eulerian subgraph. Let $\ell(G)$ be the maximum number of edges of spanning Eulerian subgraphs of a supereulerian graph $G$. In $1996$, Catlin conjectured that if $G$ is a…

Let $D$ be a strong digraph on $n\geq 4$ vertices. In [2, J. Graph Theory 22 (2) (1996) 181-187)], J. Bang-Jensen, G. Gutin and H. Li proved the following theorems: If (*) $d(x)+d(y)\geq 2n-1$ and $min \{d(x), d(y)\}\geq n-1$ for every pair…

A graph with vertex set V and edge set E is called a (d,c)-expander if the maximum degree of a vertex is d and, for every subset W of V that has cardinality at most |V|/2, the number of edges between vertices in W and vertices outside of W…

Let $D$ be a strong balanced digraph on $2a$ vertices. Adamus et al. have proved that $D$ is hamiltonian if $d(u)+d(v)\ge 3a$ whenever $uv\notin A(D)$ and $vu\notin A(D)$. The lower bound $3a$ is tight. In this paper, we shall show that the…

Let $G=(V,E)$ be a graph. A set $S\subseteq V(G)$ is a dominating set, if every vertex in $V(G)\backslash S$ is adjacent to at least one vertex in $S$. The $k$-dominating graph of $G$, $D_k (G)$, is defined to be the graph whose vertices…

A vertex u of a graph t-dominates a vertex v if there are at most t vertices different from u,v that are adjacent to v and not to u; and a graph is t-dominating if for every pair of distinct vertices, one of them t-dominates the other. Our…

Let $G(V, E)$ be a finite, simple, isolate-free graph. A set $D$ of vertices of a graph $G$ with the vertex set $V$ is a double dominating set of $G$, if every vertex $v\in D$ has at least one neighbor in $D$ and every vertex $v \in V…

Let $D$ be a strongly connected digraphs on $n\ge 4$ vertices. A vertex $v$ of $D$ is noncritical, if the digraph $D-v$ is strongly connected. We prove, that if sum of the degrees of any two adjacent vertices of $D$ is at least $n+1$, then…