컨텐츠 시작
학술대회/행사
초록검색
| 제출번호(No.) | 0250 |
|---|---|
| 분류(Section) | Contributed Talk |
| 분과(Session) | Discrete Mathematics (DM) |
| 영문제목 (Title(Eng.)) |
On complexity of cyclic coverings of graphs |
| 저자(Author(s)) |
Young Soo Kwon 1, Alexander Mednykh2, Ilya Mednykh2 Yeungnam University1, Norvosivirsk State University2 |
| 초록본문(Abstract) | By complexity of a finite graph we mean the number of spanning trees in the graph. The aim of the present talk is to give a new approach for counting complexity of cyclic coverings of a graph. |
| 분류기호 (MSC number(s)) |
05C50 |
| 키워드(Keyword(s)) | complexity of graphs, graph coverings, Laplacian matrix |
| 강연 형태 (Language of Session (Talk)) |
English |