1–20 of
99 results.

Jafari Rad, Nader
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...

Rosenfeld, Vladimir R
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...

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...

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...

Valette, Alain
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...

Pravas, K
•
Vijayakumar, A
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...

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 ...

Khormali, Omid
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$. ...

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...

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...

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...

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...

Patra, Kamal Lochan
•
Sahoo, Binod Kumar
This paper is a survey on the upper and lower bounds for the largest eigenvalue of the Laplacian matrix, known as the Laplacian spectral radius, of a graph. The bounds are given as functions of graph ...

Kim, Kijung
In 2010, Kim, Park and Sano studied the competition numbers of Johnson graphs. They gave the competition numbers of J(n,2) and J(n,3).In this note, we consider the competition number of J(n,4).

Ngurah, Anak Agung Gede
•
Simanjuntak, Rinovia
A graph G of order p and size q is called super edgemagic if there exists a bijective function f from V(G) U E(G) to {1, 2, 3, ..., p+q} such that f(x) + f(xy) + f(y) is a constant for every edge $xy...

Freyberg, Bryan
•
Keranen, Melissa
The following generalization of distance magic graphs was introduced in [2]. A directed Z_ndistance magic labeling of an oriented graph $\overrightarrow{G}=(V,A)$ of order n is a bijection $\overrigh...

Karatasos, Thodoris
•
Papaioannou, Evi
In this work, we present an innovative image recognition technique which is based on the exploitation of transitdata in images or simple photographs of sites of interest. Our objective is to automati...