Laplacian Spectra of n-Deltahedra (n ≤ 14)
碩士 === 亞洲大學 === 資訊工程學系碩士班 === 100 === We use a novel approach to construct n-deltahedra (n ≤ 14). Solving two Diophantine equations, we obtain vertex sets of deltahedra that may be either planar or non-planar graphs. By using recursive processes we construct planar graphs of deltahedra. Also, by usi...
Main Authors: | Jun-En Chien, 錢君恩 |
---|---|
Other Authors: | Keh-Ming Lu |
Format: | Others |
Language: | zh-TW |
Published: |
2012
|
Online Access: | http://ndltd.ncl.edu.tw/handle/80287544075324449877 |
Similar Items
-
Vertex-Unfoldings of Deltahedra
by: Wen-Tsang Chang, et al.
Published: (2010) -
Folding 32-Polyiamonds to Nonconvex 32-Deltahedra
by: CHI-FENG CHEN, et al.
Published: (2011) -
Solving Two Diophantine Equations Of The Vertex Sets Of Deltahedra
by: Wong, Hao-Hsuan, et al.
Published: (2012) -
Laplacian and signless laplacian spectra and energies of multi-step wheels
by: Zheng-Qing Chu, et al.
Published: (2020-05-01) -
Results on Laplacian spectra of graphs with pockets
by: Sasmita Barik, et al.
Published: (2018-04-01)