Results 1 to 10 of about 57,468 (218)
Word-Representability of Face Subdivisions of Triangular Grid Graphs [PDF]
Graphs and Combinatorics, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chen, Herman Z.Q. +2 more
openaire +4 more sources
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 +2 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
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 +2 more sources
TriCCo v1.1.0 – a cubulation-based method for computing connected components on triangular grids [PDF]
Geoscientific Model Development, 2022 We present a new method to identify connected components on triangular grids used in atmosphere and climate models to discretize the horizontal dimension.
A. Voigt +3 more
doaj +1 more source
Edge Intersection Graphs of Paths on a Triangular Grid
Anais do VII Encontro de Teoria da Computação (ETC 2022), 2022 19 pages, 12 ...
de Luca, Vitor T. F. +4 more
openaire +3 more sources
A Note on Triple Repetition Sequence of Domination Number in Graphs
InPrime, 2022 A set D subset of V(G) is a dominating set of a graph G if for all x ϵ V(G)\D, for some y ϵ D such that xy ϵ E(G). A dominating set D subset of V(G) is called a connected dominating set of a graph G if the subgraph induced by D is connected. A connected
Leomarich F. Casinillo +2 more
doaj +1 more source
Triangular-grid billiards and plabic graphs
Combinatorial Theory, 2023 16 pages, 13 ...
Defant, Colin, Jiradilok, Pakawut
openaire +5 more sources
Two-Step Colouring of Grid Graphs of Different Types
Моделирование и анализ информационных систем, 2022 In this article, we consider the NP-hard problem of the two-step colouring of a graph. It is required to colour the graph in a given number of colours in a way, when no pair of vertices has the same colour, if these vertices are at a distance of 1 or 2 ...
Alexander Valeryevich Smirnov
doaj +1 more source
Domination and Independent Domination in Extended Supergrid Graphs
Algorithms, 2022 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
Jong-Shin Chen +3 more
doaj +1 more source