On the Locating Chromatic Number of Barbell Shadow Path Graph [PDF]
Indonesian Journal of Combinatorics, 2021 The locating-chromatic number was introduced by Chartrand in 2002. The locating chromatic number of a graph is a combined concept between the coloring and partition dimension of a graph.
A. Asmiati +2 more
doaj +4 more sources
On H-antimagic coverings for m-shadow and closed m-shadow of connected graphs [PDF]
Heliyon, 2021 An (a,d)-H-antimagic total labeling of a simple graph G admitting an H-covering is a bijection φ:V(G)∪E(G)→{1,2,…,|V(G)|+|E(G)|} such that for all subgraphs H′ of G isomorphic to H, the set of H′-weights given by wtφ(H′)=∑v∈V(H′)φ(v)+∑e∈E(H′)φ(e) forms ...
Nur Inayah +2 more
doaj +5 more sources
The locating chromatic number for m-shadow of a connected graph
Electronic Journal of Graph Theory and Applications, 2022 Let c : V(G)→{1, 2, …, k} be a proper k-coloring of a simple connected graph G. Let Π = {C1, C2, …, Ck} be a partition of V(G), where Ci is the set of vertices of G receiving color i. The color code, cΠ(v), of a vertex v with respect to Π is an ordered k-
I Wayan Sudarsana +2 more
doaj +5 more sources
On D-distance (anti)magic labelings of shadow graph of some graphs
Electronic Journal of Graph Theory and ApplicationsLet G be a graph with vertex set V(G) and diameter diam(G). Let D ⊆ {0, 1, 2, 3, …, diam(G)} and φ : V(G)→{1, 2, 3, …, |V(G)|} be a bijection. The graph G is called D-distance magic, if s ∈ ND(t)φ(s) is a constant for any vertex t ∈ V(G). The graph G is
Anak Agung Gede Ngurah +2 more
doaj +5 more sources
The shadow of a Thurston geodesic to the curve graph [PDF]
Journal of Topology, 2015 34 pages, 10 figures, minor revisions, final version appears in Journal of ...
Lenzhen, Anna, Rafi, Kasra, Tao, Jing
openaire +4 more sources
Bilangan Invers Dominasi Total Pada Triangular Snake Graph, Line Triangular Snake Graph, dan Shadow Triangular Snake Graph [PDF]
Jambura Journal of Mathematics, 2022 Let G = (V(G), E(G)) be a connected graph, where V(G) is the set of vertices and E(G) is the set of edges. The set Dt(G) is called the total domination set in G if every vertex v 2 V(G) is adjacent to at least one vertex in Dt (G).
Nurhamzah Nurhamzah +2 more
doaj +2 more sources
Dual-Loop Resilient Scheduling with Predictive Path Reconfiguration for Deterministic Industrial Wireless Networks [PDF]
SensorsTo meet the deterministic and low-latency communication demands of Industry 4.0, this paper formulates resilient scheduling in interference-prone 6TiSCH industrial wireless networks as an explicit mixed-integer linear program (MILP) and proposes Dual ...
Kuo-Feng Huang
doaj +2 more sources
Physics-Informed Side-Scan Sonar Perception: Tackling Weak Targets and Sparse Debris via Geometric and Frequency Decoupling [PDF]
SensorsSide-scan sonar (SSS) serves as the primary perceptual instrument for Autonomous Underwater Vehicles (AUVs) in large-scale marine search and rescue (SAR) operations.
Bojian Yu +4 more
doaj +2 more sources
Directed Acyclic Graph Encoding for Compressed Shadow Maps [PDF]
, 2021 High-Performance Graphics - Symposium ...
Scandolo, L. (author) +1 more
core +5 more sources
Modified Sombor Spectral Radii and Modified Sombor Energies of Splitting and Shadow Graphs
Scientific Annals of Computer ScienceGutman et al. introduced Sombor and Modified Somber index because of the rapidly growing applications in chemistry and network analysis. Graph energy ε(G) and the spectral radius ℘(G) of graph G are essential components that are associated with the ...
Ahmad Bilal, Muhammad Mobeen Munir
doaj +2 more sources