Zobrazeno 1 - 10
of 123
pro vyhledávání: '"A.N.M Salman"'
Publikováno v:
Indonesian Journal of Combinatorics, Vol 2, Iss 2, Pp 72-81 (2018)
Let H and G be two simple graphs. The concept of an H-magic decomposition of G arises from the combination between graph decomposition and graph labeling. A decomposition of a graph G into isomorphic copies of a graph H is H-magic if there is a bijec
Externí odkaz:
https://doaj.org/article/90bfa60359274228a8a73e3ae2bb486e
Autor:
Zata Yumni Awanis, A.N.M. Salman
Publikováno v:
Opuscula Mathematica, Vol 42, Iss 4, Pp 527-547 (2022)
We introduce a strong \(k\)-rainbow index of graphs as modification of well-known \(k\)-rainbow index of graphs. A tree in an edge-colored connected graph \(G\), where adjacent edge may be colored the same, is a rainbow tree if all of its edges have
Externí odkaz:
https://doaj.org/article/8a2cf1583353467f86ebf5e9aed4da2c
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 10, Iss 1, Pp 33-50 (2022)
Let G be a connected and edge-colored graph of order n, where adjacent edges may be colored the same. A tree in G is a rainbow tree if all of its edges have distinct colors. Let k be an integer with 2 ≤ k ≤ n. The minimum number of colors needed
Externí odkaz:
https://doaj.org/article/b92ac1f3c3194142a93f604e991f930c
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 8, Iss 1, Pp 145-156 (2020)
An edge-colored graph G is rainbow k-connected, if there are k-internally disjoint rainbow paths connecting every pair of vertices of G. The rainbow k-connection number of G, denoted by rck(G), is the minimum number of colors needed for which there e
Externí odkaz:
https://doaj.org/article/b295703a0ad74c12ba940c338e4f45e1
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 17, Iss 1, Pp 495-502 (2020)
A face irregular total -labeling of a 2-connected plane graph is a labeling of vertices and edges such that their face-weights are pairwise distinct. The weight of a face under a labeling is the sum of the labels of all vertices and edges surrounding
Externí odkaz:
https://doaj.org/article/fd05c05267b048878a806cc9a86bfdbe
Publikováno v:
Cauchy: Jurnal Matematika Murni dan Aplikasi, Vol 5, Iss 3, Pp 112-116 (2018)
A vertex-colored graph is said to be rainbow vertex-connected, if for every two vertices and in , there exists a path with all internal vertices have distinct colors. The rainbow vertex connection number of , denoted by is the smallest number of colo
Externí odkaz:
https://doaj.org/article/ff9dcca415544f1f8380398845ffb84b
Publikováno v:
Symmetry, Vol 13, Iss 8, p 1346 (2021)
A graph G admits an H-covering if every edge of G belongs to a subgraph isomorphic to a given graph H. G is said to be H-magic if there exists a bijection f:V(G)∪E(G)→{1,2,…,|V(G)|+|E(G)|} such that wf(H′)=∑v∈V(H′)f(v)+∑e∈E(H′)f(e
Externí odkaz:
https://doaj.org/article/9962906d59b8435bacd60af8e1d8a5fc
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:
Yeva Fadhilah Ashari, A.N.M. Salman, Rinovia Simanjuntak, Andrea Semaničová-Feňovčíková, Martin Baca
Publikováno v:
Electronic Journal of Graph Theory and Applications. 11:49
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8d994baf075a542050d563da9102bfcc
https://doi.org/10.5614/ejgta.2023.11.1.5
https://doi.org/10.5614/ejgta.2023.11.1.5
Publikováno v:
Electronic Journal of Graph Theory and Applications. 11:135
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::363dc1e8c761a8b8bbd5b9c7d5f15674
https://doi.org/10.5614/ejgta.2023.11.1.11
https://doi.org/10.5614/ejgta.2023.11.1.11