지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술저널
- 저자정보
- 발행연도
- 2012.1
- 수록면
- 513 - 519 (7page)
이용수
초록· 키워드
오류제보하기
For a spanning tree T of a connected graph and for a labelling : E(T ) is called an alternating sign on a spanning tree T of a graph if for any cotree edge e 2 E()−E(T ), the unique path in T joining both end vertices of e has alternating signs. In the present article, we prove that any graph has a spanning tree T and an alternating sign on T .
목차
등록된 정보가 없습니다.
참고문헌 (10)
참고문헌 신청
S. Baader / Bipartite graphs and combinatorial adjacency
R. Furihata / 2008 / Seifert surfaces in open books, and a new coding algorithm for links / Bull. London Math. Soc. 40(3):405~414
J. Gross / 1987 / Topological graph theory,Wiley-Interscience Series in discrete Mathematics and Optimization / Wiley & Sons
C. Hayashi / 1993 / Constructing links by plumbing flat annuli / J. Knot Theory Ramifications 2:427~429
D. Kim / Basket, flat plumbing and flat plumbing basket surfaces derived from induced graphs
R. Furihata / 2008 / Seifert surfaces in open books, and a new coding algorithm for links / Bull. London Math. Soc. 40(3):405~414
J. Gross / 1987 / Topological graph theory,Wiley-Interscience Series in discrete Mathematics and Optimization / Wiley & Sons
C. Hayashi / 1993 / Constructing links by plumbing flat annuli / J. Knot Theory Ramifications 2:427~429
D. Kim / Basket, flat plumbing and flat plumbing basket surfaces derived from induced graphs
이 논문의 저자 정보
최근 본 자료
댓글(0)
0