Using Eulerian cycles construct all graphs with given degree sequence
Đã lưu trong:
Príomhúdar: | Vũ, Đinh Hòa |
---|---|
Formáid: | Bài viết |
Teanga: | Vietnamese |
Foilsithe: |
2023
|
Ábhair: | |
Rochtain Ar Líne: | https://sti.vista.gov.vn/tw/Pages/tai-lieu-khcn.aspx?ItemID=296688 https://scholar.dlu.edu.vn/thuvienso/handle/DLU123456789/128006 |
Clibeanna: |
Cuir Clib Leis
Gan Chlibeanna, Bí ar an gcéad duine leis an taifead seo a chlibeáil!
|
Thư viện lưu trữ: | Thư viện Trường Đại học Đà Lạt |
---|
Míreanna Comhchosúla
-
EXTENDED DEGREE OF RATIONAL MAPS
le: Nguyen, Dat Dang
Foilsithe: (2023) -
Some properties of a weighted graph corresponding to a monomial in (It : m2) (It : m)
le: Hà, Thị Thu Hiền
Foilsithe: (2023) -
New benchmarks for large-scale networks with given maximum degree and diameter /
le: Loz, Eyal. -
Degree prime graph /
le: Sattanathan, M. -
Some changes in practising Buon Ma Thuot-Based Ede people's life cycle rituals
le: Mai, Trọng An Vinh
Foilsithe: (2023)