Zobrazeno 1 - 10
of 123
pro vyhledávání: '"Petersen family"'
Publikováno v:
Discrete Applied Mathematics. 252:2-9
The super-connectivity (super-edge-connectivity) of a connected graph G is the minimum number of vertices (edges) that need to be deleted from G in order to disconnect G without creating isolated vertices. We determine when the generalized Petersen g
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cf68a1b943cb5b4d9d3817ec9c1effa3
https://doi.org/10.1016/j.dam.2017.02.002
https://doi.org/10.1016/j.dam.2017.02.002
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 38, Iss 2, Pp 351-370 (2018)
There are only few results concerning the crossing numbers of join of some graphs. In this paper, the crossing numbers of join products for the generalized Petersen graph P(3, 1) with n isolated vertices as well as with the path Pn on n vertices and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a93dee8e779f3993e36fab0eb63cadf3
https://doaj.org/article/60c962c5faea4d7f818b3997b32f89f4
https://doaj.org/article/60c962c5faea4d7f818b3997b32f89f4
Publikováno v:
International Journal of Computer Mathematics: Computer Systems Theory. 2:1-13
In this paper, we show that for all except n=2k+2, where is a generalized Petersen graph and is the 2-rainbow domination number of . We also conjecture that if and only if k=1, or n=2k+2 for , or ,...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dde44bac22629f261ee0909d2a86a80b
https://doi.org/10.1080/23799927.2017.1304452
https://doi.org/10.1080/23799927.2017.1304452
Publikováno v:
Open Journal of Discrete Mathematics. :185-199
A coloring of G is d-distance if any two vertices at distance at most d from each other get different colors. The minimum number of colors in d-distance colorings of G is its d-distance chromatic number, denoted by χd(G). In this paper, we give the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c93a4069809c816f7f051998c90a8029
https://doi.org/10.4236/ojdm.2017.74017
https://doi.org/10.4236/ojdm.2017.74017
Autor:
Klavdija Kutnar, Paweł Petecki
Publikováno v:
Discrete Mathematics. 339:2861-2870
The concept of double generalized Petersen graphs was introduced by Zhou and Feng in Zhou and Feng (2012), where it was asked for a characterization of the automorphism groups of these graphs. This paper gives this characterization and considers hami
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eb5d753834930dd3564b2f168834519d
https://doi.org/10.1016/j.disc.2016.05.032
https://doi.org/10.1016/j.disc.2016.05.032
Autor:
Zehui Shao, Minhong Sun
Publikováno v:
Journal of Computational and Theoretical Nanoscience. 13:6514-6518
A (total) double dominating set in a graph G is a subset S ⊆ V(G) such that each vertex in V(G) is (total) dominated by at least 2 vertices in S. The (total) double domination number of G is the minimum size of a (total) double dominating set of G.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::035abdbf661051b4bef17beef2bf0429
https://doi.org/10.1166/jctn.2016.5595
https://doi.org/10.1166/jctn.2016.5595
Autor:
Mehdi Alaeiyan, Hamed Karami
Publikováno v:
Proceedings - Mathematical Sciences. 126:289-294
In this paper, we enumerate the parameter matrices of all perfect 2-colorings of the generalized Petersen graphs GP (n,2), where n ≥ 5. We also present some basic results for GP (n, k), where n ≥ 5 and k ≥ 3.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5d780d3706f8f749cab316c818ee8147
https://doi.org/10.1007/s12044-016-0285-4
https://doi.org/10.1007/s12044-016-0285-4
Publikováno v:
Chinese Annals of Mathematics, Series B. 37:385-394
A book embedding of a graph G consists of placing the vertices of G on a spine and assigning edges of the graph to pages so that edges in the same page do not cross each other. The page number is a measure of the quality of a book embedding which is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0f885483a27851eba71c4ad285208844
https://doi.org/10.1007/s11401-016-1010-4
https://doi.org/10.1007/s11401-016-1010-4
Publikováno v:
Journal of Graph Theory. 84:146-157
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::28303007b95ae06695ddacc4b11a0fe2
https://doi.org/10.1002/jgt.22017
https://doi.org/10.1002/jgt.22017
Autor:
Zhaohong Huang, Jiangmin Pan
Publikováno v:
Graphs and Combinatorics. 32:777-784
In this paper, a complete classification is given of all the regular metacyclic covers of the Petersen graph, whose fibre-preserving groups act edge-transitively. Moreover, as an application, it is proved that there is no cubic 1-arc-regular graph wi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::530f843274fb78f11f75fb008dbae016
https://doi.org/10.1007/s00373-015-1597-3
https://doi.org/10.1007/s00373-015-1597-3