找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: ;

[复制链接]
楼主: 明显
发表于 2025-3-27 01:01:39 | 显示全部楼层
Recent results on graphical enumeration,We present four of our counting results which are to appear soon in various journals. These comprise: (1) the number of caterpillars, (2) the number of self-complementary configurations, (3) the number of achiral trees, and (4) the probability of an endpoint in a large random tree. We conclude with a brief mention of four miscellaneous results.
发表于 2025-3-27 04:30:54 | 显示全部楼层
发表于 2025-3-27 07:40:07 | 显示全部楼层
Chromatically equivalent graphs,Let G,H be graphs, and P(G,λ), P(H,λ) be the chromatic polynomials of G,H respectively. Then ., (written P .H), if P(G,λ) = P(H,λ)..In this paper, we first state some open questions relating to chromatic equivalence of graphs, and then give non-trivial examples of chromatically equivalent graphs and their chromatic polynomials.
发表于 2025-3-27 13:20:48 | 显示全部楼层
发表于 2025-3-27 13:36:47 | 显示全部楼层
发表于 2025-3-27 18:10:35 | 显示全部楼层
On the ramsey number of the five-spoked wheel,Let r(W.) be the smallest n such that the five-spoked wheel W. √ G or else W. √ . for every graph G with n vertices. Recently, Erdös asked whether whether r(W.) ≥ 18; we prove that 17 ≤ r(W.) ≤ 20. In so doing, we establish that r(C., W.) = 13. We conjecture that r(W.) = 20.
发表于 2025-3-27 23:10:29 | 显示全部楼层
Graphs and Combinatorics978-3-540-37809-9Series ISSN 0075-8434 Series E-ISSN 1617-9692
发表于 2025-3-28 04:37:36 | 显示全部楼层
发表于 2025-3-28 07:12:07 | 显示全部楼层
发表于 2025-3-28 14:25:32 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-20 13:54
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表