Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Guoyan Ao"'
Publikováno v:
Discrete Applied Mathematics. 331:1-10
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::70c03c2618dba15d3ff4d01079bd1902
https://doi.org/10.1016/j.dam.2023.01.014
https://doi.org/10.1016/j.dam.2023.01.014
Publikováno v:
Discrete Applied Mathematics. 314:17-30
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e3a4139ff6b5233c8aec748045dcf830
https://doi.org/10.1016/j.dam.2022.02.020
https://doi.org/10.1016/j.dam.2022.02.020
Publikováno v:
Bulletin of the Malaysian Mathematical Sciences Society. 46
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::021bce46d49ce0788a7cf8f2457940c3
https://doi.org/10.1007/s40840-022-01419-5
https://doi.org/10.1007/s40840-022-01419-5
Publikováno v:
Open Journal of Discrete Mathematics. 11:114-132
Let be a graph. A function is said to be a Signed Dominating Function (SDF) if holds for all . The signed domination number . In this paper, we determine the exact value of the Signed Domination Number of graphs and for , which is generalized the kno
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::07968d6fe4d35876c1284c6fa9ce7f8c
https://doi.org/10.4236/ojdm.2021.114009
https://doi.org/10.4236/ojdm.2021.114009
For integer $k\geq2,$ a spanning $k$-ended-tree is a spanning tree with at most $k$ leaves. Motivated by the closure theorem of Broersma and Tuinstra [Independence trees and Hamilton cycles, J. Graph Theory 29 (1998) 227--237], we provide tight spect
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bd6912d5089577eeb9ddbeee01a59088
