1–20 dari
99 hasil.

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

Suparta, I Nengah
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,...

Yegnanarayanan, V
Let $p \ge 3$ be a positive integer and let $k \in {1, 2, ..., p1} \ \lfloor p/2 \rfloor$. The generalized Petersen graph GP(p,k) has its vertex and edge set as $V(GP(p, k)) = \{u_i : i \in Zp\} \cup...

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

Ashraf, Faraha
•
Baca, Martin
•
SemanicovaFenovcikova, Andrea
•
Shabbir, Ayesha
A simple graph G=(V(G),E(G)) admits an Hcovering if every edge in E(G) belongs at least to one subgraph of G isomorphic to a given graph H. Then the graph G admitting Hcovering admits an Hirregular...

Seo, Suk J
•
Slater, Peter J
A distinguishing set for a graph G = (V, E) is a dominating set D, each vertex $v \in D$ being the location of some form of a locating device, from which one can detect and precisely identify any give...

Schluchter, Steven
•
Schroeder, J. Z
A proper embedding of a graph G in a pseudosurface P is an embedding in which the regions of the complement of G in P are homeomorphic to discs and a vertex of G appears at each pinchpoint in P; we s...

Aouchiche, Mustapha
•
Hansen, Pierre
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 $...

Alaeiyan, Mehdi
•
Mehrabani, Ayoob
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_...

Cymer, RadosÅ‚aw
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 ...

Acharyya, Amrita
•
Corson, Jon M
•
Das, Bikash
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 ...

Ghasemian Zoeram, Hamed
•
Yaqubi, Daniel
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 ...

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

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

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

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

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

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

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