Please use this identifier to cite or link to this item: https://ir.swu.ac.th/jspui/handle/123456789/14907
ชื่อเรื่อง: The Decycling Number of Cubic Planar Graphs
ผู้แต่ง: Punnim N.
Keywords: Geometry
Topology
Combinatorics
Cubic graphs
Discrete geometry
Planar graphs
Tianjin , China
Graph theory
วันที่เผยแพร่: 2007
บทคัดย่อ: Bau and Beineke [2] asked the following questions: 1 Which cubic graphs G of order 2n have decycling number ? 1 Which cubic planar graphs G of order 2n have decycling number ? We answered the first question in [10]. In this paper we prove that if is the class of all connected cubic planar graphs of order 2n and , then there exist integers a n and b n such that there exists a graph with φ(G) = c if and only if c is an integer satisfying a n ≤ c ≤ b n . We also find all corresponding integers a n and b n . In addition, we prove that if is the class of all connected cubic planar graphs of order 2n with decycling number and , then there exists a sequence of switchings σ 1, σ 2, ..., σ t such that for every i=1, 2, ..., t-1, and . © 2007 Springer-Verlag Berlin Heidelberg.
URI: https://ir.swu.ac.th/jspui/handle/123456789/14907
https://www.scopus.com/inward/record.uri?eid=2-s2.0-49949093746&doi=10.1007%2f978-3-540-70666-3_16&partnerID=40&md5=4bb3bd581f50ccd0175659c93add4091
ISSN: 3029743
Appears in Collections:Scopus 1983-2021

Files in This Item:
There are no files associated with this item.


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