Our system is currently under heavy load due to increased usage. We're actively working on upgrades to improve performance. Thank you for your patience.
2022
DOI: 10.31764/jtam.v6i2.6628
|View full text |Cite
|
Sign up to set email alerts
|

The Four-Distance Domination Number in the Ladder and Star Graphs Amalgamation Result and Applications

Abstract: The study purpose is to determine the four-distance domination number in the amalgamation operation graph, namely the vertex amalgamation result graph of ladder graph Amal(L_m,v,n) with m≥2 and n≥2 and the vertex amalgamation result graph of a star graph with its name Amal(S_m,v,n) with m≥2 and n>2. In addition, the application use the Four-distance domination number on Jember Regency Covid-19 taskforce post-placement. The Importanceof this research, namely the optimal distribution of the Covid-19 task forc… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 18 publications
(19 reference statements)
0
1
0
Order By: Relevance
“…Interference can be prevented with the proper channel assignment. To arrive at a solution, Hale [27][28][29][30] conceptualized the problem as a graph (vertex) coloring model, which we now refer to as the 𝐿(2,1) coloring. Consider about the different transmitters and stations that are out there.…”
Section: Applications Of Ladder Graphmentioning
confidence: 99%
“…Interference can be prevented with the proper channel assignment. To arrive at a solution, Hale [27][28][29][30] conceptualized the problem as a graph (vertex) coloring model, which we now refer to as the 𝐿(2,1) coloring. Consider about the different transmitters and stations that are out there.…”
Section: Applications Of Ladder Graphmentioning
confidence: 99%