Results 1 to 10 of about 40,647 (99)
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
Word-representability of face subdivisions of triangular grid graphs [PDF]
Graphs and Combinatorics, 2016 A graph G = (V, E) is word-representable if there exists a word w over the alphabet V such that letters x and y alternate in w if and only if (x, y) ∈ E. A triangular grid graph is a subgraph of a tiling of the plane with equilateral triangles defined by
Chen, Herman Z.Q. +2 more
core +3 more sources
The Air Flow Analysis of Coffee Plantation Based on Crops Planting Pattern of the Triangular Grid and Shackle of Wheel graphs by using a Finite Volume Method [PDF]
International Journal of Advanced Engineering Research and Science, 2017 Coffee bean is one of the Indonesia major export commodity. Based on the data from the 2012, Indonesia was ranked at third biggest coffee beans exporter in the world, after Vietnam and Brazil.
Dafik, D. (Dafik) +4 more
core +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
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
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
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
AKCE International Journal of Graphs and Combinatorics, 2021 We introduce new labeling called m-bonacci graceful labeling. A graph G on n edges is m-bonacci graceful if the vertices can be labeled with distinct integers from the set such that the derived edge labels are the first n m-bonacci numbers.
Kalpana Mahalingam +1 more
doaj +1 more source