The existence of an alternating sign on a spanning tree of graphs

Title
The existence of an alternating sign on a spanning tree of graphs
Author(s)
권영수이재운김동석[김동석]
Issue Date
201212
Citation
Kyungpook Mathematical Journal, v.52, no.4, pp.513 - 519
Abstract
For a spanning tree T of a connected graph G{cyrillic}; and for a labelling ��: E(T ) �� {+,-}, �� is called an alternating sign on a spanning tree T of a graph G{cyrillic}; if for any cotree edge e Ye{cyrillic}; E(G{cyrillic};)-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.
URI
http://hdl.handle.net/YU.REPOSITORY/26674http://dx.doi.org/10.5666/KMJ.2012.52.4.513
ISSN
1225-6951
Appears in Collections:
이과대학 > 수학과 > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE