-
>
宇宙、量子和人类心灵
-
>
(精)BBC地球故事系列-星际旅行
-
>
从一到无穷大
-
>
图说相对论(32开平装)
-
>
一本有趣又有料的化学书
-
>
刘薰宇的数学三书:原来数学可以这样学全3册
-
>
光学零件制造工艺学
图上独立圈若干问题的结构参数 版权信息
- ISBN:9787030649928
- 条形码:9787030649928 ; 978-7-03-064992-8
- 装帧:一般胶版纸
- 册数:暂无
- 重量:暂无
- 所属分类:>
图上独立圈若干问题的结构参数 内容简介
The study of graph theory started over two hundreds years ago. The earliest known paper is due to Euler(1736) about the seven bridges of Korugsberg. Since 1960s, graph theory has developed very fast and numerous results on graph theory sprung forth. There are many nice and celebrated problems in graph theory, such as Hamiltonian problem, four-color problem, Chinese postman problem, etc. Moreover, graph theory is widely applied in chemistry, computer science, biology and other disciplines. As a subfield in discrete mathematics, graph theory has attracted much attention from all perspectives. All graphs are considered only finite, simple, undirected graphs with no loops and no multiple edges. Let G be a graph. The Hamiltonian cycle problem is one of the most well-known problems in graph theory. A cycle which contains every vertex of G is called a Hamiltonian cycle. A cycle is called a chorded cycle if this cycle contains at least one chord. A k-factor in a graph G is a spanning k-regular subgraph of G, where k is a positive integer. There exists many interesting results about the existence of k-factor, by applying Tutte's Theorem, however, we mainly focus on the existence of 2-factor throughout this thesis. Clearly, a Hamiltonian cycle is a 2-factor with exactly one component. From this point of view, it is a more complex procedure to find the condition to ensure the existence of 2-factor in a given graph. The most usual technique to resolve 2-factor problems is to find a minimal packing and then extend it to a required 2-factor. The book is concerned with structural invariants for packing cycles in a graph and partitions of a graph into cycles, i.e., finding a prescribed number of vertex-disjoint cycles and vertex-partitions into a prescribed number of cycles in graphs. It is well-known that the problem of determining whether a given graph has such partitions or not, is NP-complete. Therefore, many researchers have investigated degree conditions for packing and partitioning. This book mainly focuses on the following invariants for such problems: minimum degree, average degree (also extremal function), degree sum of independent vertices and the order condition with minimum degree.
图上独立圈若干问题的结构参数 目录
- >
月亮与六便士
月亮与六便士
¥13.4¥42.0 - >
有舍有得是人生
有舍有得是人生
¥21.2¥45.0 - >
回忆爱玛侬
回忆爱玛侬
¥10.5¥32.8 - >
李白与唐代文化
李白与唐代文化
¥9.9¥29.8 - >
龙榆生:词曲概论/大家小书
龙榆生:词曲概论/大家小书
¥9.1¥24.0 - >
罗曼·罗兰读书随笔-精装
罗曼·罗兰读书随笔-精装
¥40.6¥58.0 - >
莉莉和章鱼
莉莉和章鱼
¥16.0¥42.0 - >
山海经
山海经
¥20.4¥68.0
-
时间简史-普及版
¥16.3¥38 -
数学的魅力;初等数学概念演绎
¥10.8¥22 -
图说相对论(32开平装)
¥14.7¥46 -
刘薰宇的数学三书:原来数学可以这样学全3册
¥35.4¥118 -
中职对口升学数学复习指导
¥23.1¥30 -
高等数学基础
¥31.5¥45