Results 1 to 10 of about 3,343 (219)
TOTAL EDGE IRREGULAR LABELING FOR TRIANGULAR GRID GRAPHS AND RELATED GRAPHS
Barekeng, 2023 Let be a graph with and are the set of its vertices and edges, respectively. Total edge irregular -labeling on is a map from to satisfies for any two distinct edges have distinct weights. The minimum for which the satisfies the labeling is spoken
Muhammad Nurul Huda, Yeni Susanti
doaj +4 more sources
Word-Representability of Face Subdivisions of Triangular Grid Graphs [PDF]
Graphs and Combinatorics, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sergey Kitaev
exaly +5 more sources
A Limit Conjecture on the Number of Hamiltonian Cycles on Thin Triangular Grid Cylinder Graphs
Discussiones Mathematicae Graph Theory, 2018 We continue our research in the enumeration of Hamiltonian cycles (HCs) on thin cylinder grid graphs Cm × Pn+1 by studying a triangular variant of the problem. There are two types of HCs, distinguished by whether they wrap around the cylinder.
Bodroža-Pantić Olga +3 more
doaj +4 more sources
Hamiltonian properties of triangular grid graphs [PDF]
Discrete Mathematics, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Frank Werner
exaly +5 more sources
On the Number of Shortest Weighted Paths in a Triangular Grid
Mathematics, 2020 Counting the number of shortest paths in various graphs is an important and interesting combinatorial problem, especially in weighted graphs with various applications. We consider a specific infinite graph here, namely the honeycomb grid. Changing to its
Benedek Nagy, Bashar Khassawneh
doaj +4 more sources
CYCLIC PROPERTIES OF TRIANGULAR GRID GRAPHS [PDF]
IFAC Postprint Volumes IPPV / International Federation of Automatic Control, 2006 Abstract It is known that all 2-connected, linearly convex triangular grid graphs, with only one exception, are hamiltonian (Reay and Zamfirescu, 2000). In the paper, it is shown that this result holds for a wider class of connected, locally connected triangular grid graphs and, with more exceptions, even for some general class of graphs.
Yury Orlovich +2 more
exaly +3 more sources
An isoperimetric inequality and pursuit-evasion games on triangular grid graphs
Discrete Applied Mathematics, 2023 19 pages, 10 figures ...
Teeradej Kittipassorn
exaly +4 more sources
On the optimal layout of (K p − C p ) n into grid and certain structures [PDF]
Scientific ReportsInterconnection networks constitute complex configurations of processors and communication links that facilitate data transmission between processors in a parallel computing system.
G. Caroline Vincy, David Raj Micheal
doaj +2 more sources
Probabilistic Distributed Algorithm for Uniform Election in Triangular Grid Graphs [PDF]
International Journal of Advanced Computer Science and Applications, 2013 Probabilistic algorithms are designed to handle problems that do not admit deterministic effective solutions.In the case of the election problem, many algorithms are available and applicable under appropriate assumptions, for example: the uniform election in trees, k-trees and polyominoids.In this paper, first, we introduce a probabilistic algorithm ...
El Mehdi Laadissi
exaly +2 more sources
Some new characterizations of Hamiltonian cycles in triangular grid graphs
Discrete Applied Mathematics, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Olga Bodroža-Pantić +2 more
exaly +2 more sources