|
|
|
|
|
Jong-Shin Chen, Ruo-Wei Hung, Fatemeh Keshavarz-Kohjerdi and Yung-Fa Huang
Supergrid graphs are derived by computing stitch paths for computerized embroidery machines. In the past, we have studied the Hamiltonian-related properties of supergrid graphs and their subclasses of graphs. In this paper, we propose a generalized graph...
ver más
|
|
|
|
|
|
|
|
|
|
|
Abdel-Rahman Hedar, Shada N. Abdulaziz, Adel A. Sewisy and Gamal A. El-Sayed
An efficient routing using a virtual backbone (VB) network is one of the most significant improvements in the wireless sensor network (WSN). One promising method for selecting this subset of network nodes is by finding the minimum connected dominating se...
ver más
|
|
|
|
|
|
|
|
|
|
|
Rajesh Kanna,R. Pradeep Kumar,Sudharsan Vijayaraghavan,Ananda Kumar M.R,Soner Nandappa D
In this paper, we introduce MathGraph, an open-source and cross-platform Python package.As a Python package, MathGraph is easily integrable with graph visualization softwares. This helps researchers in graph theory to either create a graph programmatical...
ver más
|
|
|
|
|
|
|
|
|
|
|
Stephen Finbow and Christopher M. van Bommel
For a graph ??=(??,??)
G
=
(
V
,
E
)
, the ??
?
-graph of G, denoted ??(??)=(??(??),??(??))
G
(
?
)
=
(
V
(
?
)
,
E
(
?
)
)
, is the graph whose vertex set is the collection of minimum dominating sets, or ??
?
-sets of G, and two ??
?
-sets are adjacent ...
ver más
|
|
|
|
|
|