Zobrazeno 1 - 10
of 601
pro vyhledávání: '"total graph"'
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 19, Iss 3, Pp 316-324 (2022)
AbstractThis article presents a survey of results consisting of the Wiener index of graphs associated with commutative rings. In particular, we focus on zero-divisor graphs, unit graphs, total graphs and prime graphs. Further, we have posed some open
Externí odkaz:
https://doaj.org/article/1f91a8d27265441abbce04be976e5c12
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 19, Iss 3, Pp 229-237 (2022)
AbstractFor a graph [Formula: see text] we call a subset [Formula: see text] a total mixed dominating set of G if each element of [Formula: see text] is either adjacent or incident to an element of S, and the total mixed domination number of G is the
Externí odkaz:
https://doaj.org/article/72d19692b4c64c4885e8658329c36bd4
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.
Publikováno v:
Theory and Applications of Graphs, Vol 9, Iss 2, Pp 1-14 (2022)
Given a vertex coloring c of a graph, the neighborhood color set of a vertex is defined to be the set of all of its neighbors’ colors. The coloring c is called a set coloring if any two adjacent vertices have different neighborhood color sets. The
Externí odkaz:
https://doaj.org/article/546a47d28eb24d8e95edf018b1bf4ec2
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 10, Iss 1, Pp 301-309 (2022)
Suppose G = (V, E) be a simple graph with p vertices and q edges. An edge-magic total labeling of G is a bijection f : V ∪ E → {1, 2, …, p + q} where there exists a constant r for every edge xy in G such that f(x)+f(y)+f(xy)=r. An edge-magic to
Externí odkaz:
https://doaj.org/article/ef8f4b35100e42099e94af9d544274ff
Autor:
Birinchi Kumar Boruah, Tazid Ali
Publikováno v:
Network Biology, Vol 12, Iss 1, Pp 1-10 (2022)
Suppose R be a commutative ring and Z(R) its set of zero-divisors. Total graph is the (undirected) graph where set of all elements of R is taken as the vertex set and two vertices say x and y (x not equals to y) in R are adjacent if and only if their
Externí odkaz:
https://doaj.org/article/e517eeea3c4645faa618dbad375cba1a
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
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.
Publikováno v:
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, Vol 29, Iss 3, Pp 151-181 (2021)
In this paper, we determine the r-dynamic chromatic number of the fan graph Fm,n and determine sharp bounds of this graph invariant for four related families of graphs: The middle graph M(Fm,n), the total graph T (Fm,n), the central graph C(Fm,n) and
Externí odkaz:
https://doaj.org/article/89c3ab1229a843eeb956e83a546f6186