1–20 of
84 results.

 Do, PhanThuan
 Le, NgocKhang
 Vu, VanThieu
Trapezoid graphs are intersection graphs of trapezoids between two horizontal lines. Many NPhard problems can be solved in polynomial time if they are restricted on trapezoid graphs. A matching in a ...

For any $k \in \mathbb{N}$, the $k$distance graph $D^{k}G$ has the same vertex set of $G$, and two vertices of $D^{k}G$ are adjacent if they are exactly distance $k$ apart in the original graph $G$. ...

 Driscoll, Keith
 Krop, Elliot
 Nguyen, Michelle
For any integer $k>0$, a tree $T$ is $k$cordial if there exists a labeling of the vertices of $T$ by $\mathbb{Z}_k$, inducing edgeweights as the sum modulo $k$ of the labels on incident vertices ...

 Mishra, Debdas
 Rout, Sushant Kumar
 Nayak, Puma Chandra
Here we denote a {\it diameter six tree} by $(c; a_{1}, a_{2}, \ldots, a_{m}; b_{1}, b_{2}, \ldots, b_{n}; c_{1}, c_{2}, \ldots, c_{r})$, where $c$ is the center of the tree; $a_{i}, i = 1, 2, \ldo...

 Silaban, Denny Riama
 Baskoro, Edy Tri
 Uttunggadewa, Saladin
Let $G$ and $H$ be simple graphs. The Ramsey number for a pair of graph $G$ and $H$ is the smallest number $r$ such that any redblue coloring of edges of $K_r$ contains a red subgraph $G$ or a blue s...

A subset $X$ of edges of a graph $G$ is called an \textit{edgedominating set} of $G$ if every edge not in $X$ is adjacent tosome edge in $X$. The edge domination number $\gamma'(G)$ of $G$ is the mini...

 Ashrafi, Ali Reza
 Gholami, Ahmad
 Mehranian, Zeinab
The power graph $\mathcal{P}(G)$ of a group $G$ is the graphwith group elements as vertex set and two elements areadjacent if one is a power of the other. The aim of this paper is to compute the autom...

 Alfuraidan, Monther Rashed
 Zakariya, Yusuf F
Let $(\Gamma,*)$ be a finite group and $S$ a possibly empty subset of $\Gamma$ containing its nonselfinvertible elements. In this paper, we introduce the inverse graph associated with $\Gamma$ whose...

 Mirafzal, Seyed Morteza
 Zafari, Ali
Let $\Gamma=Cay(\mathbb{Z}_n, S_k)$ be the Cayley graph on the cyclic additive group $\mathbb{Z}_n$ $(n\geq 4),$ where $S_1=\{1, n1\}$, \dots , $S_k=S_ {k1}\cup\{k, nk\}$ are the inverseclosed s...

 Moghaddam, S.M. Hosseini
 Mojdeh, D.A
 Samadi, Babak
 Volkmann, Lutz
In this paper, we study the signed 2independence number in graphs and give new sharp upper and lower bounds on the signed 2independence number of a graph by a simple uniform approach. In this way, w...

A {\em retractingfree bidirectional circuit} in a graph $G$ is a closed walk which traverses every edge exactly once in each direction and such that no edge is succeeded by the same edge in the oppos...

 Lusiani, Anie
 Baskoro, Edy Tri
 Saputro, Suhadi Wido
Let $K_{l\times t}$ be a complete, balanced, multipartite graph consisting of $l$ partite sets and $t$ vertices in each partite set. For given two graphs $G_1$ and $G_2$, and integer $j\geq 2$, the si...

For a finite connected graph $X$, we consider the graph $RX$ obtained from $X$ by associating a new vertex to every edge of $X$ and joining by edges the extremities of each edge of $X$ to the correspo...

 P, Padmapriya
 Mathad, Veena
Let $G = (V,E)$ be a simple connected graph. Theeccentricdistance sum of $G$ is defined as$\xi^{ds}(G) =\ds\sum_{\{u,v\}\subseteq V(G)} [e(u)+e(v)] d(u,v)$, where $e(u)$ %\dsis the eccentricity of th...

The Gallai and the antiGallai graphs of a graph $G$ are complementary pairs of spanning subgraphs of the line graph of $G$. In this paper we find some structural relations between these graph classes...

 Rajarajachozhan, R
 Sampathkumar, R
A twin edge $k\!$coloring of a graph $G$ is a proper edge $k$coloring of $G$ with the elements of $\mathbb{Z}_k$ so that the induced vertex $k$coloring, in which the color of a vertex $v$ in $G$ is...

 Vatandoost, Ebrahim
 Ramezani, Fatemeh
Let $R$ be a commutative ring (with 1) and let $Z(R)$ be its set of zerodivisors. The zerodivisor graph $\Gamma(R)$ has vertex set $Z^*(R)=Z(R) \setminus \lbrace0 \rbrace$ and for distinct $x,y \in ...

 Vivin, J. Vernold
 Kaliraj, K
The notion of equitable colorability was introduced by Meyer in $1973$ \cite{meyer}. In this paper we obtain interesting results regarding the equitable chromatic number $\chi_{=}$ for the corona grap...

 Karim, N.S.A
 Hasni, Roslan
 Lau, GeeChoon
For a graph $G$, let $P(G,\lambda)$ denote the chromatic polynomial of $G$. Two graphs $G$ and $H$ are chromatically equivalent if they share the same chromatic polynomial. A graph $G$ is chromaticall...

 Pirzada, Shariefuddin
 Ganie, Hilal A
 Siddique, Merajuddin
For a graph $G$ with vertex set $V(G)=\{v_1, v_2, \dots, v_n\}$, let $S$ be the covering set of $G$ having the maximum degree over all the minimum covering sets of $G$. Let $N_S[v]=\{u\in S : uv \in E...