21–40 of
114 results.

Monther Rashed Alfuraidan
•
Yusuf F. Zakariya
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...

S. M. Hosseini Moghaddam
•
D. A. Mojdeh
•
Babak Samadi
•
Lutz Volkmann
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...

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

Ali Reza Ashrafi
•
Ahmad Gholami
•
Zeinab Mehranian
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...

Seyed Morteza Mirafzal
•
Ali Zafari
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...

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

Debdas Mishra
•
Sushant Kumar Rout
•
Puma Chandra Nayak
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...

Keith Driscoll
•
Elliot Krop
•
Michelle Nguyen
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 ...

Denny Riama Silaban
•
Edy Tri Baskoro
•
Saladin Uttunggadewa
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...

Anie Lusiani
•
Edy Tri Baskoro
•
Suhadi Wido Saputro
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...

Mustapha Aouchiche
•
Pierre Hansen
The paper discusses bounds on the nullity number of graphs. It is proved in [B. Cheng and B. Liu, On the nullity of graphs. Electron. J. Linear Algebra 16 (2007) 6067] that $\eta \le n  D$, where $...

Mehdi Alaeiyan
•
Ayoob Mehrabani
Perfect coloring is a generalization of the notion of completely regular codes, given by Delsarte. A perfect mcoloring of a graph G with m colors is a partition of the vertex set of G into m parts A_...

RadosÅ‚aw Cymer
In decomposition theory, extreme sets have been studied extensively due to its connection to perfect matchings in a graph. In this paper, we first define extreme sets with respect to degreematchings ...

Amrita Acharyya
•
Jon M. Corson
•
Bikash Das
We generalize the idea of cofinite groups, due to B. Hartley, [2]. First we define cofinite spaces in general. Then, as a special situation, we study cofinite graphs and their uniform completions.The ...

Hamed Ghasemian Zoeram
•
Daniel Yaqubi
A vertex of degree one is called an endvertex and the set of endvertices of G is denoted by End(G). For a positive integer k, a tree T be called kended tree if $End(T) \leq k$. In this paper, we ...

Kamal Lochan Patra
•
Binod Kumar Sahoo
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 ...

Anak Agung Gede Ngurah
•
Rinovia Simanjuntak
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...

Bryan Freyberg
•
Melissa Keranen
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...

Thodoris Karatasos
•
Evi Papaioannou
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...

I. Nengah Suparta
A Gray code of length n is a list of all binary words of length n such that each two successive codewords differ in only one bit position. If the first and the last codewords also share this property,...