21–40 of
129 results.

Eunice MphakoBanda
•
Julian A. Allagan
We give some reduction formulas for computing the Tutte polynomial of any graph with parallel classes. Several examples are given to illustrate our results.

Ramin Nasiri
•
Hamid Reza Ellahi
•
Gholam Hossein FathTabar
•
Ahmad Gholami
The signless Laplacian Estrada index of a graph $G$ is defined as $SLEE(G)=\sum^{n}_{i=1}e^{q_i}$ where $q_1, q_2, \ldots, q_n$ are the eigenvalues of the signless Laplacian matrix of G. Following th...

B. Sooryanarayana
•
Suma A. S.
Let G=(V,E) be a simple connected graph. A subset S of V is called a neighbourhood set of G if $G=\bigcup_{s\in S}<N[s]>$, where N[v] denotes the closed neighbourhood of the vertex v in G. Furth...

Marvin Minei
•
Howard Skogman
We give a new construction of Ramanujan graphs using a generalized type of covering graph called a weighted covering graph. For a given prime p the basic construction produces bipartite Ramanujan grap...

Ali Ahmad
•
Ashok Gupta
•
Rinovia Simanjuntak
In computer science, graphs are used in variety of applications directly or indirectly. Especially quantitative labeled graphs have played a vital role in computational linguistics, decision making so...

Nobuaki Obata
•
Alfi Y. Zakiyyah
A connected graph is said to be of QE class if it admits a quadratic embedding in a Hilbert space, or equivalently, if the distance matrix is conditionally negative definite. Several criteria for a g...

Ali Sadeghieh
•
Nima Ghanbari
•
Saeid Alikhani
Let G be a finite connected graph of order n. The Gutman index Gut(G) of G is defined as $\sum_{\{x,y\}\subseteq V(G)}deg(x)deg(y)d(x, y)$, where deg(x) is the degree of vertex x in G and d(x, y) is t...

Martin Baca
•
Andrea SemanicovaFenovcikova
•
S. Slamin
•
Kiki A. Sugeng
For a simple graph G, a vertex labeling f:V(G)\to {1, 2, ..., k} is called a klabeling. The weight of a vertex v, denoted by $wt_f(v)$ is the sum of all vertex labels of vertices in the closed neigh...

HÃ¥kan Lennerstad
•
Mattias Eriksson
In this paper we consider node labelings c of an undirected connected graph G=(V,E) with labels {1,2,... ,V}, which induce a list distance c(u,v)=c(v)c(u) besides the usual graph distance d(u,v)....

Uma Tul Samee
•
Shariefuddin Pirzada
A $k$partite $r$digraph(multipartite multidigraph) (or briefly MMD)($k\geq 3$, $r\geq 1$) is the result of assigning a direction to each edge of a $k$partite multigraph that is without loops and co...

PhanThuan Do
•
NgocKhang Le
•
VanThieu Vu
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 ...

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

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

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