找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Algebraic Graph Theory; Chris Godsil,Gordon Royle Textbook 2001 Springer-Verlag New York, Inc. 2001 algebra.Eigenvalue.graph.graph theory.

[复制链接]
查看: 14169|回复: 58
发表于 2025-3-21 16:58:54 | 显示全部楼层 |阅读模式
期刊全称Algebraic Graph Theory
影响因子2023Chris Godsil,Gordon Royle
视频video
发行地址Includes supplementary material:
学科分类Graduate Texts in Mathematics
图书封面Titlebook: Algebraic Graph Theory;  Chris Godsil,Gordon Royle Textbook 2001 Springer-Verlag New York, Inc. 2001 algebra.Eigenvalue.graph.graph theory.
Pindex Textbook 2001
The information of publication is updating

书目名称Algebraic Graph Theory影响因子(影响力)




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




书目名称Algebraic Graph Theory网络公开度




书目名称Algebraic Graph Theory网络公开度学科排名




书目名称Algebraic Graph Theory被引频次




书目名称Algebraic Graph Theory被引频次学科排名




书目名称Algebraic Graph Theory年度引用




书目名称Algebraic Graph Theory年度引用学科排名




书目名称Algebraic Graph Theory读者反馈




书目名称Algebraic 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-21 23:27:30 | 显示全部楼层
Decolonizing Palestinian Political Economye tools they used in this paper led to a proof that a Moore graph has diameter at most two. They themselves proved that a Moore graph of diameter two must be regular, with valency 2, 3, 7, or 57. We will provide the machinery to prove this last result in our work on strongly regular graphs in Chapter 10.
发表于 2025-3-22 04:18:19 | 显示全部楼层
发表于 2025-3-22 05:46:47 | 显示全部楼层
发表于 2025-3-22 10:01:56 | 显示全部楼层
https://doi.org/10.1057/978-1-137-52724-0ally to the study of a number of interesting combinatorial objects, such as double occurrence words, chord diagrams, circle graphs, and maps. Questions that are motivated by the theory of knots and links can often be clarified or solved by being reformulated as a question in one of these different contexts.
发表于 2025-3-22 14:07:08 | 显示全部楼层
发表于 2025-3-22 20:21:39 | 显示全部楼层
发表于 2025-3-23 00:33:54 | 显示全部楼层
发表于 2025-3-23 05:09:03 | 显示全部楼层
发表于 2025-3-23 06:18:47 | 显示全部楼层
Knots and Eulerian Cycles,ally to the study of a number of interesting combinatorial objects, such as double occurrence words, chord diagrams, circle graphs, and maps. Questions that are motivated by the theory of knots and links can often be clarified or solved by being reformulated as a question in one of these different contexts.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-18 20:27
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表