Results 1 to 10 of about 4,981 (200)
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 +3 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
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
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
AVD proper edge-coloring of some families of graphs
International Journal of Mathematics for Industry, 2021 Adjacent vertex-distinguishing proper edge-coloring is the minimum number of colors required for the proper edge-coloring of [Formula: see text] in which no two adjacent vertices are incident to edges colored with the same set of colors.
J. Naveen
doaj +1 more source
On Triangular Secure Domination Number
InPrime, 2020 Let T_m=(V(T_m), E(T_m)) be a triangular grid graph of m ϵ N level. The order of graph T_m is called a triangular number. A subset T of V(T_m) is a dominating set of T_m if for all u_V(T_m)\T, there exists vϵT such that uv ϵ E(T_m), that is, N[T]=V(T_m).
Emily L Casinillo +3 more
doaj +1 more source
Applying Infinite Petri Nets to the Cybersecurity of Intelligent Networks, Grids and Clouds
Applied Sciences, 2021 Correctness of networking protocols represents the principal requirement of cybersecurity. Correctness of protocols is established via the procedures of their verification. A classical communication system includes a pair of interacting systems.
Dmitry A. Zaitsev +2 more
doaj +1 more source