Authentication email has already been sent, please check your email box: and activate it as soon as possible.
You can login to My Profile and manage your email alerts.
If you haven’t received the email, please:
|
|
There are 1 papers published in subject: > since this site started. |
Results per page: |
Select Subject |
Select/Unselect all | For Selected Papers |
Saved Papers
Please enter a name for this paper to be shown in your personalized Saved Papers list
|
1. On the anti-Kelul'{e} number of cubic graphs | |||
LI Qiu-Li, SHIU Wai-Chee,SUN Pak-Kiu,YE Dong | |||
Mathematics 20 July 2016 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:The anti-Kekul'{e} numberof a connected graph $G$ is the smallest number of edges to be removed to create a connected subgraph without perfect matchings. In this article, weshow that the anti-Kekul'{e} number of a 2-connectedcubic graph is either 3 or 4, and the anti-Kekul'{e} numberof a connected cubic bipartite graph is always equal to 4.Direct application of these results shows that the anti-Kekul'{e} number of aboron-nitrogen fullerene, a toroidal fullerene and a Klein-bottle fullerene is 4, and the anti-Kekul'{e}number of a (3,6)-fullerene is 3. Moreover, we show that all the smallest anti-Kekul'{e} sets in a cubic graph can be found out in a polynomial time with respect to the order of the graph. | |||
TO cite this article:LI Qiu-Li, SHIU Wai-Chee,SUN Pak-Kiu, et al. On the anti-Kelul'{e} number of cubic graphs[OL].[20 July 2016] http://en.paper.edu.cn/en_releasepaper/content/4700932 |
Select/Unselect all | For Selected Papers |
Saved Papers
Please enter a name for this paper to be shown in your personalized Saved Papers list
|
Results per page: |
About Sciencepaper Online | Privacy Policy | Terms & Conditions | Contact Us
© 2003-2012 Sciencepaper Online. unless otherwise stated