Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Hanaa Alashwali"'
Publikováno v:
AIMS Mathematics, Vol 9, Iss 2, Pp 4587-4603 (2024)
Let $ G $ be a graph with adjacency matrix $ A(G) $, and let $ D(G) $ be the diagonal matrix of the degrees of $ G $. For any real number $ \alpha\in [0, 1] $, Nikiforov defined the $ A_{\alpha} $-matrix of $ G $ as $ A_{\alpha}(G) = \alpha D (G)
Externí odkaz:
https://doaj.org/article/35ae81e24fb44dce9ac146c5349069f9
Publikováno v:
AIMS Mathematics, Vol 9, Iss 2, Pp 4098-4108 (2024)
Let $ R $ be a ring and $ U(R) $ be the set of unit elements of $ R $. The unit graph $ G(R) $ of $ R $ is the graph whose vertices are all the elements of $ R $, defining distinct vertices $ x $ and $ y $ to be adjacent if and only if $ x + y \in U(
Externí odkaz:
https://doaj.org/article/e8c59be3628947f8ac3a57f5d09b4e8c
Publikováno v:
International Journal of Analysis and Applications, Vol 18, Iss 6, Pp 1108-1122 (2020)
For a graph G = (V, E), a vertex coloring (or, simply, a coloring) of G is a function C: V (G) → {1, 2, ..., k} (using the non-negative integers {1, 2, ..., k} as colors). In this research work, we introduce a new type of graph coloring called mono
Externí odkaz:
https://doaj.org/article/d63d8ad17b264c90b43e6081c9563b5b
Publikováno v:
Applied Mathematics. :264-273
For any graph G, the Inj-equitable graph of a graph G, denoted by IE (G) , is the graph with the same vertices as G and for any two adjacent vertices u and v in IE (G), ≤ 1, where for any vertex w∈V (G) , degin (w) = . In this paper, Inj-equitabl
Publikováno v:
Applied Mathematics. :2132-2139
A dominating set D in a graph G is called an injective equitable dominating set (Inj-equitable dominating set) if for every , there exists such that u is adjacent to v and . The minimum cardinality of such a dominating set is denoted by and is called