Add to ORKGSemigraph is a generalization of graph, with two or more vertices on edges which allows multiplicity in every concept of graph when it comes to semigraph. When number of vertices on the edges are restricted to two the semigraph is a graph, so every graph is a semigraph. In this article we deal with the variety of bipartite semigraphs, namely bipartite, s-bipartite and e-bipartite and bounds for their domination number (adjacent domination number and end vertex adjacent domination number) in particular when the semigraph is a cycle and also about possible size of the bipartite sets when the bipartite semigraph is a cycle.Publisher's Versio
A cycle C is a vertex-dominating cycle if every vertex is adjacent to some vertex of C. Bondy and Fa...
Consider all k-element subsets and ℓ-element subsets (k>ℓ) of an n-element set as vertices of a bipa...
The main theme of this BSc thesis are the domination sets and the corresponding domination number of...
. Semigraph is a pair where is a nonempty set whose elements are called vertices of and is a se...
We prove that the domination number of a graph of order n and minimum degree at least 2 that does no...
DOMINATING SET remains NP-complete even when instances are restricted to bipartite graphs, however, ...
summary:The domatic numbers of a graph $G$ and of its complement $\bar{G}$ were studied by J. E. Du...
summary:For any graph $G$, let $V(G)$ and $E(G)$ denote the vertex set and the edge set of $G$ respe...
summary:For any graph $G$, let $V(G)$ and $E(G)$ denote the vertex set and the edge set of $G$ respe...
This thesis work on the two parameters that is very important domination parameters, one parameter i...
A set $S \subseteq V(G)$ is a semitotal dominating set of a graph $G$ if it is a dominating se...
A set S of vertices of a graph G is distinguishing if the sets of neighbors in S for every pair of v...
A subset D of vertices of a connected graph G is called a semiglobal total dominating set if D is a...
Abstract. The paper continues the study of independent set dominating sets in graphs which was start...
This thesis deals with the following three independent problems. Po'sa proved that if $G$ is an ...
A cycle C is a vertex-dominating cycle if every vertex is adjacent to some vertex of C. Bondy and Fa...
Consider all k-element subsets and ℓ-element subsets (k>ℓ) of an n-element set as vertices of a bipa...
The main theme of this BSc thesis are the domination sets and the corresponding domination number of...
. Semigraph is a pair where is a nonempty set whose elements are called vertices of and is a se...
We prove that the domination number of a graph of order n and minimum degree at least 2 that does no...
DOMINATING SET remains NP-complete even when instances are restricted to bipartite graphs, however, ...
summary:The domatic numbers of a graph $G$ and of its complement $\bar{G}$ were studied by J. E. Du...
summary:For any graph $G$, let $V(G)$ and $E(G)$ denote the vertex set and the edge set of $G$ respe...
summary:For any graph $G$, let $V(G)$ and $E(G)$ denote the vertex set and the edge set of $G$ respe...
This thesis work on the two parameters that is very important domination parameters, one parameter i...
A set $S \subseteq V(G)$ is a semitotal dominating set of a graph $G$ if it is a dominating se...
A set S of vertices of a graph G is distinguishing if the sets of neighbors in S for every pair of v...
A subset D of vertices of a connected graph G is called a semiglobal total dominating set if D is a...
Abstract. The paper continues the study of independent set dominating sets in graphs which was start...
This thesis deals with the following three independent problems. Po'sa proved that if $G$ is an ...
A cycle C is a vertex-dominating cycle if every vertex is adjacent to some vertex of C. Bondy and Fa...
Consider all k-element subsets and ℓ-element subsets (k>ℓ) of an n-element set as vertices of a bipa...
The main theme of this BSc thesis are the domination sets and the corresponding domination number of...