Zobrazeno 1 - 10
of 40
pro vyhledávání: '"Liliek Susilowati"'
Publikováno v:
F1000Research, Vol 12 (2024)
textbf{Background}: One of the topics of distance in graphs is the resolving set problem. Suppose the set $W=\{s_1,s_2,…,s_k\}\subset V(G)$, the vertex representations of $\in V(G)$ is $r_m(x|W)=\{d(x,s_1),d(x,s_2),…,d(x,s_k)\}$, where $d(x,s_i)$
Externí odkaz:
https://doaj.org/article/88a6fc448ac14d3b9c67599edaac8871
Publikováno v:
AIMS Mathematics, Vol 8, Iss 9, Pp 21298-21311 (2023)
The local metric dimension is one of many topics in graph theory with several applications. One of its applications is a new model for assigning codes to customers in delivery services. Let $ G $ be a connected graph and $ V(G) $ be a vertex set of $
Externí odkaz:
https://doaj.org/article/f37b4787a8564343877a19851e7262c8
Publikováno v:
AIMS Mathematics, Vol 8, Iss 4, Pp 8349-8364 (2023)
Resolving set has several applications in the fields of science, engineering, and computer science. One application of the resolving set problem includes navigation robots, chemical structures, and supply chain management. Suppose the set $ W = \left
Externí odkaz:
https://doaj.org/article/50b0742f146747a8964eb7addacc10e8
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 19, Iss 3, Pp 287-295 (2022)
AbstractIn this paper, we introduce the twin g-noncommuting graph of a finite group that is developed by combining the concepts of the g-noncommuting graph and the twin noncommuting graph of a finite group. The twin g-noncommuting graph of a finite g
Externí odkaz:
https://doaj.org/article/6a5fe0c4d0844c8db35e1055b5c3161c
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 44, Iss 3, p 1051 (2024)
Externí odkaz:
https://doaj.org/article/b9a3a5c04e2844a69c60a7ff46697a54
Publikováno v:
Theory and Applications of Graphs, Vol 10, Iss 2 (2023)
Let $G$ be a connected graph of order $n$. The Wiener index $W(G)$ of $G$ is the sum of the distances between all unordered pairs of vertices of $G$. The well-known upper bound $\big( \frac{n}{\delta+1}+2\big) {n \choose 2}$ on the Wiener index of a
Externí odkaz:
https://doaj.org/article/12f1eca687854b95b1781a5097491d7a
Publikováno v:
Symmetry, Vol 15, Iss 1, p 12 (2022)
Given a graph G with vertex set V(G) and edge set E(G), for the bijective function f(V(G))→{1,2,⋯,|V(G)|}, the associated weight of an edge xy∈E(G) under f is w(xy)=f(x)+f(y). If all edges have pairwise distinct weights, the function f is calle
Externí odkaz:
https://doaj.org/article/52191d23585040a69ddc2a04467798c5
Publikováno v:
Baghdad Science Journal, Vol 18, Iss 2 (2021)
The metric dimension and dominating set are the concept of graph theory that can be developed in terms of the concept and its application in graph operations. One of some concepts in graph theory that combine these two concepts is resolving dominatin
Externí odkaz:
https://doaj.org/article/a1c541b2ff8149f78ce14fad599e6dd1
Publikováno v:
Baghdad Science Journal, Vol 17, Iss 4 (2020)
The local resolving neighborhood of a pair of vertices for and is if there is a vertex in a connected graph where the distance from to is not equal to the distance from to , or defined by . A local resolving function of is a real valued function such
Externí odkaz:
https://doaj.org/article/a662aa433c8e411cb57e6e134316e4b9
Publikováno v:
Heliyon, Vol 6, Iss 3, Pp e03633- (2020)
The G be a connected graph with vertex set V(G) and edge set E(G). A subset S⊆V(G) is called a dominating set of G if for every vertex x in V(G)∖S, there exists at least one vertex u in S such that x is adjacent to u. An ordered set W⊆V(G) is c
Externí odkaz:
https://doaj.org/article/7004b16ca8d14cb5a463f57f494624c0