用户名  找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: A Textbook of Graph Theory; R. Balakrishnan,K. Ranganathan Textbook 20001st edition Springer Science+Business Media New York 2000 Graph th

[复制链接]
查看: 31375|回复: 46
发表于 2025-3-21 16:26:10 | 显示全部楼层 |阅读模式
期刊全称A Textbook of Graph Theory
影响因子2023R. Balakrishnan,K. Ranganathan
视频video
学科分类Universitext
图书封面Titlebook: A Textbook of Graph Theory;  R. Balakrishnan,K. Ranganathan Textbook 20001st edition Springer Science+Business Media New York 2000 Graph th
影响因子Graph theory has experienced a tremendous growth during the 20th century. One of the main reasons for this phenomenon is the applicability of graph theory in other disciplines such as physics, chemistry, psychology, sociology, and theoretical computer science. This book aims to provide a solid background in the basic topics of graph theory. It covers Dirac‘s theorem on k-connected graphs, Harary-Nashwilliam‘s theorem on the hamiltonicity of line graphs, Toida-McKee‘s characterization of Eulerian graphs, the Tutte matrix of a graph, Fournier‘s proof of Kuratowski‘s theorem on planar graphs, the proof of the nonhamiltonicity of the Tutte graph on 46 vertices and a concrete application of triangulated graphs. The book does not presuppose deep knowledge of any branch of mathematics, but requires only the basics of mathematics. It can be used in an advanced undergraduate course or a beginning graduate course in graph theory..
Pindex Textbook 20001st edition
The information of publication is updating

书目名称A Textbook of Graph Theory影响因子(影响力)




书目名称A Textbook of Graph Theory影响因子(影响力)学科排名




书目名称A Textbook of Graph Theory网络公开度




书目名称A Textbook of Graph Theory网络公开度学科排名




书目名称A Textbook of Graph Theory被引频次




书目名称A Textbook of Graph Theory被引频次学科排名




书目名称A Textbook of Graph Theory年度引用




书目名称A Textbook of Graph Theory年度引用学科排名




书目名称A Textbook of Graph Theory读者反馈




书目名称A Textbook of Graph Theory读者反馈学科排名




单选投票, 共有 0 人参与投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-22 00:02:38 | 显示全部楼层
发表于 2025-3-22 03:00:13 | 显示全部楼层
发表于 2025-3-22 08:12:15 | 显示全部楼层
Hinweise zu den Analysenmethoden,consequences of the Tutte-Nashwilliams theorem on the existence of . pairwise edge-disjoint spanning trees in a simple connected graph. We also present Cay ley’s formula for the number of spanning trees in the labeled complete graph ..
发表于 2025-3-22 10:26:07 | 显示全部楼层
Schwefel-Stickstoff-Verbindungen,raphs and, in particular, in bipartite graphs. Matchings in bipartite graphs have varied applications in operations research. We also present two celebrated theorems of graph theory, namely, Tutte’s 1-factor theorem and Hall’s matching theorem. ..
发表于 2025-3-22 16:32:21 | 显示全部楼层
A Textbook of Graph Theory978-1-4419-8505-7Series ISSN 0172-5939 Series E-ISSN 2191-6675
发表于 2025-3-22 19:10:07 | 显示全部楼层
发表于 2025-3-22 21:44:24 | 显示全部楼层
Bodo Heyn,Bernd Hipler,Dirk Waltherf a vertex or an edge from the graph destroys the connectedness of the graph. There are graphs in the other extreme as well, such as the complete graphs ., . ≥ 2, which remain connected even after removal of all but one vertex.
发表于 2025-3-23 01:57:18 | 显示全部楼层
https://doi.org/10.1007/978-1-4419-8505-7Graph theory; Matching; algorithms; graphs; vertices; combinatorics
发表于 2025-3-23 06:32:43 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-7 13:28
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表