Zobrazeno 1 - 10
of 1 530
pro vyhledávání: '"Cycle graph"'
Neutrosophic Fuzzy Magic Labeling Graph with its Application in Academic Performance of the Students
Publikováno v:
Neutrosophic Sets and Systems, Vol 60, Pp 75-112 (2023)
Graph labelling is the assignment of labels to the edges, vertices, or both. The issue of limiting the spread of non-interfering frequencies allotted to radio transmitters serves as the motivation for the research on labelling graphs according to dif
Externí odkaz:
https://doaj.org/article/fc48c2bae28a47e18c503ca4bcdaefc5
Autor:
Yamada Hiroshi
Publikováno v:
Open Mathematics, Vol 21, Iss 1, Pp 1-45 (2023)
Using notions from linear algebraic graph theory, this article provides a unified perspective on some autocorrelation measures in different fields. They are as follows: (a) Orcutt’s first serial correlation coefficient, (b) Anderson’s first circu
Externí odkaz:
https://doaj.org/article/db0798bc475e4504b9c8a94e0e23ce41
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
Autor:
Konstantin Gorbunov, Vassily Lyubetsky
Publikováno v:
Mathematics, Vol 12, Iss 6, p 817 (2024)
The mathematical side of applied problems in multiple subject areas (biology, pattern recognition, etc.) is reduced to the problem of discrete optimization in the following mathematical method. We were provided a network and graphs in its leaves, for
Externí odkaz:
https://doaj.org/article/a43e697892b342f38d19072d3ea0fb26
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:
Dmitrii O. Logofet
Publikováno v:
Mathematics, Vol 11, Iss 14, p 3237 (2023)
Given several nonnegative matrices with a single pattern of allocation among their zero/nonzero elements, the average matrix should have the same pattern, too. This is the first tenet of the pattern-multiplicative average (PMA) concept, while the sec
Externí odkaz:
https://doaj.org/article/9032a37070e74de39e42cd4563cb5bae
Autor:
Konstantin Gorbunov, Vassily Lyubetsky
Publikováno v:
Mathematics, Vol 11, Iss 9, p 2024 (2023)
The paper solves the problem of constructing an evolutionary tree and the evolution of structures along it. This problem has long been posed and extensively researched; it is formulated and discussed below. As a result, we construct an exact cubic-ti
Externí odkaz:
https://doaj.org/article/9e40a252a17943088b40d50d1a0fb32a
Publikováno v:
Heliyon, Vol 8, Iss 6, Pp e09596- (2022)
Let G=(V(G),E(G)) be a connected, finite, simple, and undirected graph. The distance between two vertices u,w∈V(G), denoted by d(u,w), is the shortest length of (u,w)-path in G. The distance between a vertex v∈V(G) is defined as min{d(v,x):x
Externí odkaz:
https://doaj.org/article/2b16337d2b544b408d41acd46873cf8a
Autor:
J. Paulraj Joseph, N. Shunmugapriya
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 17, Iss 3, Pp 887-891 (2020)
Let be a simple connected graph. An ordered subset W of V is said to be a resolving set of G if every vertex is uniquely determined by its vector of distances to the vertices in W. The minimum cardinality of a resolving set is called the resolving nu
Externí odkaz:
https://doaj.org/article/c6f91525625d4bd6893086bcefcb7072