检索结果-南通市图书馆

THE MAXIMUM GENUS OF A 3-REGULAR SIMPLICIAL GRAPH

在线全文

学校读者我要写书评

暂无评论

Applied Mathematics(A Journal of Chinese Universities) 1999年第2期14卷 203-214页

作者： LiDeming liuyanpei Dept.ofMath. CapitalNormalUnivBeijing100037. Dept ofMath.NorthernJiaotongUniv.Beijing100044.

Abstract In this paper, the relationship between non separating independent number and the maximum genus of a 3 regular simplicial graph is presented. A lower bound on the maximum genus of a 3 regular graph involving ... 详细信息

关键词： 1991 MR Subject Classification 05C10

A CHARACTERIZATION OF EMBEDDABILITY OF GRAPHS ON SURFACES

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Applied Mathematics(A Journal of Chinese Universities) 1998年第2期13卷 159-164页

作者： LIUYING liuyanpei DepartmentofMathematics NorthernJiaotongUniversityBeijing100044 RUTCOR RutgersUniversityNewBrunswickNJ08903USA

In this article the C n graphs are introduced, by which a characterization of the embeddability of a graph on either an orientable surface or a non orientable surface is provided.

关键词： Jordan curve polyhedron C-graph surface

LOWER BOUNDS ON THE MAXIMUM GENUS OF LOOPLESS MULTIGRAPHS

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Applied Mathematics(A Journal of Chinese Universities) 2000年第4期15卷 359-368页

作者： LiDeming liuyanpei Dept.ofMath. CapitalNormalUniv.Beijing100037 Dept.ofMath. NorthernJiaotongUniv.Beijing100044

The lower bounds on the maximum genus of loopless graphs are obtained according to the connectivity of these graphs. This not only answers a question of Chen, Archdeacon and Gross, but also generalizes the previous kn... 详细信息

关键词： Maximum genus lower bound multigraph.

COUNTING ROOTED NEAR-4-REGULAR EULERIAN MAPSON SOME SURFACES

在线全文

学校读者我要写书评

暂无评论

Applied Mathematics(A Journal of Chinese Universities) 1999年第3期14卷 245-250页

作者： RenHan liuyanpei Dept.ofMath. XiamenUniv.Xiamen361005. Dept.ofMath. NorthernJiaotongUniv..Beiiing100044.

In this article the rooted planar near-4-regular Eulerian trails are enum erated and an explicit form ula for such m aps is presented. Further, the rooted near-4-regular Eulerian m aps on the torus are counted in an... 详细信息

关键词： Map enufunction Euler trail Lagrangian inversion near-4-regular Eulerian m ap(trail).

A TIGHT LOWER BOUND ON THE MAXIMUM GENUS OF A 3-CONNECTED LOOPLESS MULTIGRAPH

在线全文

学校读者我要写书评

暂无评论

Applied Mathematics(A Journal of Chinese Universities) 2000年第4期15卷 369-376页

作者： LiDeming liuyanpei Dept.ofMath. CapitalNormalUniv.Beijing100037. Dept.ofMath. NorhternJiaotongUniv.Beijing100044.

It is proved that every 3 connected loopless multigraph has maximum genus at least one third of its cycle rank plus one if its cycle rank is not less than ten, and if its cycle rank is less than ten,it is upper ***... 详细信息

关键词： Maximum genus graph connectivity.

DETERMINATION OF THE DENSEST SUBGRAPH

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Science & Complexity 2004年第1期17卷 23-27页

作者： DONGJinquan liuyanpei SchoolofManagement InnerMongoliaPolytechnicUniversityHuhhot010062China DepartmentofMathematics NorthernJiaotongUniversityBeijing100044China

Define the density d(G) of a graph G as (ε(G))/(v(G)). A polynomialalgorithm for finding the densest subgraph of a graph is provided. Some results related to thedensity of the densest subgraph of a graph are obtained... 详细信息

关键词： density algorithm orientation computable