找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Covering Walks in Graphs; Futaba Fujie,Ping Zhang Book 2014 Futaba Fujie, Ping Zhang 2014 Hamiltonian graph.spanning walk.traceable number

[复制链接]
查看: 44943|回复: 35
发表于 2025-3-21 19:22:16 | 显示全部楼层 |阅读模式
书目名称Covering Walks in Graphs
编辑Futaba Fujie,Ping Zhang
视频videohttp://file.papertrans.cn/240/239201/239201.mp4
概述Provides a comprehensive treatment on measures of Hamiltonicity and traversability in graphs.Contains intriguing open problems and conjectures on spanning walks in graphs.Describes new frame works for
丛书名称SpringerBriefs in Mathematics
图书封面Titlebook: Covering Walks in Graphs;  Futaba Fujie,Ping Zhang Book 2014 Futaba Fujie, Ping Zhang 2014 Hamiltonian graph.spanning walk.traceable number
描述.Covering Walks  in Graphs. is aimed at researchers and graduate students in the graph theory community and provides a comprehensive treatment on measures of two well studied graphical properties, namely Hamiltonicity and traversability in graphs. This text looks into the famous Kӧnigsberg Bridge Problem, the Chinese Postman Problem, the Icosian Game and the Traveling Salesman Problem as well as well-known mathematicians who were involved in these problems. The concepts of different spanning walks with examples and present classical results on Hamiltonian numbers and upper Hamiltonian numbers of graphs are described; in some cases, the authors provide proofs of these results to illustrate the beauty and complexity of this area of research. Two new concepts of traceable numbers of graphs and traceable numbers of vertices of a graph which were inspired by and closely related to Hamiltonian numbers are introduced. Results are illustrated on these two concepts and the relationship between traceable concepts and Hamiltonian concepts are examined. Describes several variations of traceable numbers, which provide new frame works for several well-known Hamiltonian concepts and produce inter
出版日期Book 2014
关键词Hamiltonian graph; spanning walk; traceable number; traversability in graphs; combinatorics
版次1
doihttps://doi.org/10.1007/978-1-4939-0305-4
isbn_softcover978-1-4939-0304-7
isbn_ebook978-1-4939-0305-4Series ISSN 2191-8198 Series E-ISSN 2191-8201
issn_series 2191-8198
copyrightFutaba Fujie, Ping Zhang 2014
The information of publication is updating

书目名称Covering Walks in Graphs影响因子(影响力)




书目名称Covering Walks in Graphs影响因子(影响力)学科排名




书目名称Covering Walks in Graphs网络公开度




书目名称Covering Walks in Graphs网络公开度学科排名




书目名称Covering Walks in Graphs被引频次




书目名称Covering Walks in Graphs被引频次学科排名




书目名称Covering Walks in Graphs年度引用




书目名称Covering Walks in Graphs年度引用学科排名




书目名称Covering Walks in Graphs读者反馈




书目名称Covering Walks in Graphs读者反馈学科排名




单选投票, 共有 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-21 20:48:43 | 显示全部楼层
发表于 2025-3-22 01:59:22 | 显示全部楼层
发表于 2025-3-22 07:36:04 | 显示全部楼层
发表于 2025-3-22 09:29:05 | 显示全部楼层
发表于 2025-3-22 14:30:29 | 显示全部楼层
发表于 2025-3-22 18:08:14 | 显示全部楼层
Open vertex-covering walks is the subject of this chapter, resulting in the concepts of traceable walks and traceable numbers, defined in terms of the sum of the distances of consecutive terms in an ordering of the vertices of a connected graph. Variations of these numbers are discussed in some detail.
发表于 2025-3-22 23:46:05 | 显示全部楼层
发表于 2025-3-23 03:19:33 | 显示全部楼层
Traceable Walks,Open vertex-covering walks is the subject of this chapter, resulting in the concepts of traceable walks and traceable numbers, defined in terms of the sum of the distances of consecutive terms in an ordering of the vertices of a connected graph. Variations of these numbers are discussed in some detail.
发表于 2025-3-23 07:56:26 | 显示全部楼层
Covering Walks in Graphs978-1-4939-0305-4Series ISSN 2191-8198 Series E-ISSN 2191-8201
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 吾爱论文网 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
QQ|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-8-15 17:44
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表