81–100 of
114 results.

Kristiana Wijaya
•
Edy Tri Baskoro
•
Hilda Assiyatun
•
Djoko Suprijanto
Let $F, G,$ and $H$ be nonempty graphs. The notation $F \rightarrow (G,H)$ means that if all edges of $F$ are arbitrarily colored by red or blue, then either the subgraph of $F$ induced by all red ed...

Clive Elphick
•
Pawel Wocjan
This paper gives an errata to the paper "New measure of graph irregularity", Electronic Journal of Graph Theory and Applications {\bf 2}(1) (2014), 5265.

C. Dalfo
•
M. A. Fiol
•
M. Mitjana
We study a family of graphs related to the $n$cube. The middle cube graph of parameter k is the subgraph of $Q_{2k1}$ induced by the set of vertices whose binary representation has either $k1$ or $...

Colton Magnant
•
Pouria Salehi Nowbandegani
•
Hua Wang
Given a collection of $d$dimensional rectangular solids called blocks, no two of which sharing interior points, construct a block graph by adding a vertex for each block and an edge if the faces of t...

Anita Abildgaard Sillasen
The degree/diameter problem for directed graphs is the problem of determining the largest possible order for a digraph with given maximum outdegree d and diameter k. An upper bound is given by the Mo...

S. Arockiaraj
•
P. Mahalakshmi
•
P. Namasivayam
An injective function $f:V(G)\rightarrow \{0,1,2,\dots,q\}$ is an odd sum labeling if the induced edge labeling $f^*$ defined by $f^*(uv)=f(u)+f(v),$ for all $uv\in E(G),$ is bijective and $f^*(E(G))=...

Peter Recht
•
Stefan Stehling
This paper addresses upper and lower bounds for the cardinality of a maximum vertex/edgedisjoint cycle packing in a polyhedral graph G. Bounds on the cardinality of such packings are provided, that ...

Ayesha Shabbir
In this note, we consider triangular, square and hexagonal lattices on the flat Klein bottle, and find subgraphs with the property that for any $j$ vertices there exists a longest path (cycle) avoidin...

Ashish K. Upadhyay
•
Dipendu Maity
We present a necessary and sufficient condition for existence of edgedisjoint contractible Hamiltonian Cycles in the edge graph of polyhedral maps.

Yanbo Zhang
•
Yaojun Chen
For two given graphs $F$ and $H$, the Ramsey number $R(F,H)$ is the smallest integer $N$ such that for any graph $G$ of order $N$, either $G$ contains $F$ or the complement of $G$ contains $H$. Let $F...

Joe Demaio
•
John Jacobson
In 1982, Prodinger and Tichy defined the Fibonacci number of a graph G to be the number of independent sets of the graph G. They did so since the Fibonacci number of the path graph Pn is the Fibonacci...

Dominique Buset
•
Mirka Miller
•
Oudone Phanalasy
•
Joe Ryan
An antimagic labeling of a graph $G=(V,E)$ is a bijection from the set of edges $E$ to the set of integers $\{1,2,\dots, E\}$ such that all vertex weights are pairwise distinct, where the weight of ...

S. P. Subbiah
•
J. Pandimadevi
An Hmagic labeling in an Hdecomposable graph G is a bijection f:V(G) U E(G) > {1,2, … ,p+q} such that for every copy H in the decomposition, $\sum\limits_{v\in V(H)} f(v)+\sum\limits_{e\in E(H)...

Cristina Dalfo
•
Miquel Àngel Fiol
We study the (Delta,D) and (Delta,N) problems for doublestep digraphs considering the unilateral distance, which is the minimum between the distance in the digraph and the distance in its converse di...

Mustapha Chellali
•
Nader Jafari Rad
•
Suk Jai Seo
•
Peter James Slater
A set D of vertices in a graph G = (V (G), E(G)) is an open neighborhood locatingdominating set (OLDset) for G if for every two vertices u, v of V (G) the sets N(u) ∩ D and N(v) ∩ D are nonempty an...

Anita Abildgaard Sillasen
A kgeodetic digraph G is a digraph in which, for every pair of vertices u and v (not necessarily distinct), there is at most one walk of length at most k from u to v. If the diameter of G is k, we sa...

Deepa Sinha
•
Ayushi Dhama
A signed graph (or, $sigraph$ in short) is a graph G in which each edge x carries a value $\sigma(x) \in \{, +\}$ called its sign. Given a sigraph S, the negation $\eta(S)$ of the sigraph S is a sigr...

Henning Fernau
•
Juan A. RodriguezVelazquez
In this paper, we show that several graph parameters are known in different areas under completely different names.More specifically, our observations connect signed domination, monopolies, $\alpha$d...

N. Paramaguru
•
R. Sampathkumar
For k≥2, a modular kcoloring of a graph G without isolated vertices is a coloring of the vertices of G with the elements in Zk having the property that for every two adjacent vertices of G, the sums ...

Hebert PerezRoses
This paper discusses the most popular algebraic techniques and computational methods that have been used to construct large graphs with given degree and diameter.