[PDF][PDF] On the diameter and some related invariants of fullerene graphs
Match-Communications in Mathematical and Computer Chemistry, 2012•researchgate.net
… We show that the diameter of a fullerene graph G of order n is at least … We also report
an improved lower bound on the independence number and an upper bound on the
smallest eigenvalue of fullerene graphs, confirming some conjectures for large fullerene
graphs. … In this paper we establish lower and upper bounds for the diameter of fullerene
graphs and use the results to improve the upper bound on their saturation number and
settling the relationship between the independence number and the diameter. The …
an improved lower bound on the independence number and an upper bound on the
smallest eigenvalue of fullerene graphs, confirming some conjectures for large fullerene
graphs. … In this paper we establish lower and upper bounds for the diameter of fullerene
graphs and use the results to improve the upper bound on their saturation number and
settling the relationship between the independence number and the diameter. The …
Abstract
Fullerene graphs are 3-connected 3-regular planar graphs with only pentagonal and hexagonal faces. We show that the diameter of a fullerene graph G of order n is at least
researchgate.net
以上显示的是最相近的搜索结果。 查看全部搜索结果