Using Eulerian cycles construct all graphs with given degree sequence
Guardat en:
Autor principal: | Vũ, Đinh Hòa |
---|---|
Format: | Article |
Idioma: | Vietnamese |
Publicat: |
2023
|
Matèries: | |
Accés en línia: | https://sti.vista.gov.vn/tw/Pages/tai-lieu-khcn.aspx?ItemID=296688 https://scholar.dlu.edu.vn/thuvienso/handle/DLU123456789/128006 |
Etiquetes: |
Afegir etiqueta
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|
Thư viện lưu trữ: | Thư viện Trường Đại học Đà Lạt |
---|
Ítems similars
-
EXTENDED DEGREE OF RATIONAL MAPS
per: Nguyen, Dat Dang
Publicat: (2023) -
Some properties of a weighted graph corresponding to a monomial in (It : m2) (It : m)
per: Hà, Thị Thu Hiền
Publicat: (2023) -
New benchmarks for large-scale networks with given maximum degree and diameter /
per: Loz, Eyal. -
Degree prime graph /
per: Sattanathan, M. -
Some changes in practising Buon Ma Thuot-Based Ede people's life cycle rituals
per: Mai, Trọng An Vinh
Publicat: (2023)