Cargando…
Vertex-deleted subgraphs and regular factors from regular graph()
Let [Formula: see text] , [Formula: see text] , and [Formula: see text] be three integers such that [Formula: see text]. Let [Formula: see text] be a [Formula: see text]-regular, [Formula: see text]-edge-connected graph of odd order. We obtain some sufficient conditions for [Formula: see text] to co...
Autores principales: | Lu, Hongliang, Wang, Wei, Bai, Bing |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Elsevier
2011
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3160777/ https://www.ncbi.nlm.nih.gov/pubmed/21984842 http://dx.doi.org/10.1016/j.disc.2011.04.035 |
Ejemplares similares
-
On Vertex Covering Transversal Domination Number of Regular Graphs
por: Vasanthi, R., et al.
Publicado: (2016) -
A Coding Method for Efficient Subgraph Querying on Vertex- and Edge-Labeled Graphs
por: Zhu, Lei, et al.
Publicado: (2014) -
Distance-regular graphs
por: Brouwer, Andries E, et al.
Publicado: (1989) -
Subgraph Learning for Topological Geolocalization with Graph Neural Networks
por: Zha, Bing, et al.
Publicado: (2023) -
Vertex Deletion into Bipartite Permutation Graphs
por: Bożyk, Łukasz, et al.
Publicado: (2022)