A note on the existence of an alternating sign on a spanning tree of graphs
Kim, Dongseok · Kwon, Young Soo · Lee, Jaeun
Original · EN
For a spanning tree T of a connected graph G and for a labelling ϕ: E(T) → +, -, ϕis called an alternating sign on a spanning tree T of a graph G if for any cotree edge e ∈ E(G)-E(T), the unique path in T joining both end vertices of e has alternating signs. In the present note, we prove that any graph has a spanning tree T and an alternating sign on T.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.