Zobrazeno 1 - 10
of 98
pro vyhledávání: '"De bruijn digraph"'
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:
Electronic Journal of Graph Theory and Applications, Vol 9, Iss 2, Pp 527-538 (2021)
The d-Fibonacci digraphs F(d, k), introduced here, have the number of vertices following some generalized Fibonacci-like sequences. They can be defined both as digraphs on alphabets and as iterated line digraphs. Here we study some of their nice prop
Externí odkaz:
https://doaj.org/article/e25bf4662c1a4eee81cc9fb8ac404f92
Autor:
Miguel Angel Fiol, Cristina Dalfó
Publikováno v:
Electronic Journal of Graph Theory and Applications
Electronic Journal of Graph Theory and Applications, Vol 9, Iss 2, Pp 527-538 (2021)
Repositorio Abierto de la UdL
Universitad de Lleida
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Electronic Journal of Graph Theory and Applications, Vol 9, Iss 2, Pp 527-538 (2021)
Repositorio Abierto de la UdL
Universitad de Lleida
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
The d-Fibonacci digraphs F(d, k), introduced here, have the number of vertices following some generalized Fibonacci-like sequences. They can be defined both as digraphs on alphabets and as iterated line digraphs. Here we study some of their nice prop
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::744b45d5d2638bd5619839cad3266c9c
https://hdl.handle.net/10459.1/72285
https://hdl.handle.net/10459.1/72285
Publikováno v:
Discrete Optimization. 25:77-85
Let D = ( V , A ) be a digraph with vertex set V and arc set A . An efficient absorbant (respectively, dominating set) of a digraph D = ( V , A ) is a set S ⊆ V such that, for every v ∈ V ∖ S , there exists exactly one out-neighbor (respectivel
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c2c461b8fdcd03070fbb282448dde104
https://doi.org/10.1016/j.disopt.2017.01.005
https://doi.org/10.1016/j.disopt.2017.01.005
Publikováno v:
Frontiers of Mathematics in China. 12:339-357
Let G = (V,A) be a digraph and k ≥ 1 an integer. For u, v ∈ V, we say that the vertex u distance k-dominate v if the distance from u to v at most k. A set D of vertices in G is a distance k-dominating set if each vertex of V D is distance k-domin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a21735dfe8a7d66b65ac5e42d7ec06ac
https://doi.org/10.1007/s11464-016-0607-y
https://doi.org/10.1007/s11464-016-0607-y
Autor:
Miguel Angel Fiol, Cristina Dalfó
Publikováno v:
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
instname
Repositorio Abierto de la UdL
Universitad de Lleida
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
instname
Repositorio Abierto de la UdL
Universitad de Lleida
A digraph Γ =(V, E) is a line digraph when every pair of vertices u, v∈V have either equal or disjoint in-neighborhoods. When this condition only applies for vertices in a given subset (with at least two elements), we say that Γ is a locally line
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::17b9e70e6f7bd272d7dc3a52d32780fb
https://doi.org/10.1016/j.laa.2016.03.014
https://doi.org/10.1016/j.laa.2016.03.014
Publikováno v:
International Journal of Computer Mathematics. 94:922-932
An absorbant of a digraph D is a set such that, for every , there exists an arc with . An absorbant S is efficient if no two vertices in S have a common in-neighbour and the subdigraph induced by S has no arc. The efficient absorbant conjecture in ge
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7fc7d9b580af3b11800f71844332d938
https://doi.org/10.1080/00207160.2016.1154949
https://doi.org/10.1080/00207160.2016.1154949
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:
Discrete Mathematics. 338:1501-1508
In a digraph G = ( V , A ) , a vertex u is said to dominate its out-neighbors v , that is, there is an arc ( u , v ) ? A . A set D ? V is a dominating set of G if each vertex of V ? D is dominated by some vertex of D . The domination number of G , de
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5ca950dc7d51c823e5bb858f61850803
https://doi.org/10.1016/j.disc.2015.03.011
https://doi.org/10.1016/j.disc.2015.03.011
Autor:
Kramer Alpar-Vajk
Publikováno v:
Discrete Mathematics. 312(3):608-613
In this paper, it is proved that for every positive odd integer n, there exists a Hamiltonian cycle in the De Bruijn digraph B(2,n) on middle levels.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1ead998848cdcfa26c7781b7cb32bf5e