Zobrazeno 1 - 10
of 168
pro vyhledávání: '"Middle graph"'
Publikováno v:
Examples and Counterexamples, Vol 6, Iss , Pp 100152- (2024)
Locating the origin of diffusion in complex networks is an interesting but challenging task. It is crucial for anticipating and constraining the epidemic risks. Source localization has been considered under many feasible models. In this paper, we stu
Externí odkaz:
https://doaj.org/article/b3528a1368e94bf5a608b73bf75cb5a0
Publikováno v:
Transactions on Combinatorics, Vol 12, Iss 2, Pp 79-91 (2023)
In this paper, we study the domination number of middle graphs. Indeed, we obtain tight bounds for this number in terms of the order of the graph G. We also compute the domination number of some families of graphs such as star graphs, double start gr
Externí odkaz:
https://doaj.org/article/6a008674255043fc83b9af61320dbfc1
Autor:
Roopa Subhas Naikar
Publikováno v:
Ratio Mathematica, Vol 51, Iss 0 (2024)
Topological index is sometimes also known as graph theoretic index, is a numerical invariant of a graph, the topological indices are classified on degree and distance based concepts. The status σ(u) of a vertex u ∈ V (G) is defined as the sum of i
Externí odkaz:
https://doaj.org/article/2905b33a11e04ebab14eba1307036bc2
Autor:
S. Yahya Mohamed, S Suganthi
Publikováno v:
Ratio Mathematica, Vol 43, Iss 0, Pp 176-182 (2022)
A fuzzy matching is a set of edges in which an edge does not incident on a vertex with same membership value. If every vertex of fuzzy graph is M-Plunged then the fuzzy matching is called as fair fuzzy matching. In this paper, we introduce the new co
Externí odkaz:
https://doaj.org/article/69f9d71249704c23be72a38a6aa8e5c4
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Kijung Kim
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 19, Iss 3, Pp 325-329 (2022)
AbstractLet [Formula: see text] be a graph of order n(G). For a subset S of V(G), the boundary of S is defined as [Formula: see text] where N(S) is the open neighborhood of S. The external private neighborhood set of v with respect to S is defined as
Externí odkaz:
https://doaj.org/article/81ef6344ded34babad9669adc3544f7c
Autor:
Dr. S. Suganthi, Dr. S. Yahya Mohamed
Publikováno v:
Pandian Journal of Mathematical Sciences, Vol 1, Iss 1, Pp 31-36 (2022)
A fuzzy matching is a set of edges in which an edge does not incident on a vertex with same membership value. If every vertex of fuzzy graph is M-Plunged then the fuzzy matching is called as fair fuzzy matching. In this paper, we introduce the new co
Externí odkaz:
https://doaj.org/article/d0e3458f33b347b3ae25311d5a09d460
Publikováno v:
ITM Web of Conferences, Vol 61, p 01001 (2024)
Let G = (V,E) be a graph with a vertex set V and an edge set E of G, with order n. Modular irregular labeling of a graph G is an edge k-labeling φ:E → {1, 2,…,k} such that the modular weight of all vertices is all different. The modular weight i
Externí odkaz:
https://doaj.org/article/c26b041c94d24026b7d486f918b9d9bb
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 10, Iss 1, Pp 275-288 (2022)
A total dominating set of a graph G with no isolated vertices is a subset S of the vertex set such that every vertex of G is adjacent to a vertex in S. The total domination number of G is the minimum cardinality of a total dominating set. In this pap
Externí odkaz:
https://doaj.org/article/bb1602dc538242259d435aaf778c64c5
Autor:
Mohamed R. Zeen El Deen, Ghada Elmahdy
Publikováno v:
AIMS Mathematics, Vol 7, Iss 3, Pp 3554-3589 (2022)
Graph labeling is a source of valuable mathematical models for an extensive range of applications in technologies (communication networks, cryptography, astronomy, data security, various coding theory problems). An edge $ \; \delta - $ graceful label
Externí odkaz:
https://doaj.org/article/a3a6208e2d7d4b1c9f504e516fc3a279