|
OALib Journal期刊
ISSN: 2333-9721
费用：99美元
|
|
|
|
独立数≤5的3-边连通简单图的上可嵌入性(英文)
, PP. 17-20
Keywords: 图,最大亏格,betti亏数,上可嵌入的,独立数
Abstract:
结合边连通度,本文探讨了3-边连通简单图的独立数与上可嵌入性的关系,我们得到了下列结果:设g是一个3-边连通简单图,α(g)是g的独立数,若α(g)≤5,则g是上可嵌入的,同时我们又得到了两个在3-边连通意义下最小的非上可嵌入图例.
| [1] | bondyja,murtyusr.graphtheorywithapplications[m].newyork:elsevierscience,1976.
|
| [2] | nordhause,stewartb,whiteat.onthemaximumgenusofagraph[j].journalcombinatorialtheoryseriesb,1971,11:258-267.
|
| [3] | kundus.boundsonnumberofdisjointspanningtrees[j].journalcombinatorialtheoryseriesb,1974,17:199-203.
|
| [4] | xuongnh.upper-embeddablegraphsandrelatedtopics[j].journalofcombinatorialtheoryseriesb,1979,26:226-232.
|
| [5] | huangyp,liuyp.themaximumgenusofgraphswithdiameterthree[j].discretemathematics,1999,194(1/3):139-149.
|
| [6] | stahls.theembeddingsofagraphasurvey[j].jgraphtheory,1978,2:275-298.
|
| [7] | xuongnh.howtodeterminethemaximumgenusofagraph[j].journalofcombinatorialtheoryseriesb,1979,26:217-225.
|
| [8] | jungermanm.acharacterizationofupper-embeddablegraphs[j].transactionsoftheamericanmathematicalsociety,1978,241:401-406.
|
| [9] | nebeskyl.anewcharacterizationsofthemaximumgenusofgraphs[j].czechoslovakmathj,1981,31(106):604-613.
|
| [10] | huangyq,liuyp.animprovementofatheoremonthemaximumgenusforgraphs[j].mathematicaapplicate,1998,11(2):109-112.
|
Full-Text
|
|
Contact Us
service@oalib.com QQ:3279437679 
WhatsApp +8615387084133
|
|
