找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Line Graphs and Line Digraphs; Lowell W. Beineke,Jay S. Bagga Book 2021 Springer Nature Switzerland AG 2021 Line graphs.Line digraphs.Alge

[复制链接]
楼主: bradycardia
发表于 2025-3-26 21:04:57 | 显示全部楼层
发表于 2025-3-27 01:16:02 | 显示全部楼层
Iterated Line Digraphsne step, more interesting things can happen, one being that connectedness is not necessarily preserved. Another instance is that a digraph can be isomorphic to its second iterated line digraph but not to its first. In more general terms, there are digraphs for which, after a while, the sequence of i
发表于 2025-3-27 06:24:36 | 显示全部楼层
Total Graphs and Total Digraphsrch into variations and generalizations of the subject. In this, the first of several chapters on such topics, instead of just the edges of a given graph becoming the vertices of a new graph, both the vertices and the edges of the original become vertices. The new graph is called the total graph of
发表于 2025-3-27 12:36:17 | 显示全部楼层
Path Graphs and Path Digraphsthese vertices being given by their having a path of length 1 in common and their union being either a path or cycle of length 3. After proving some basic results, we turn to the characterization of path graphs, the main theorem being an analogue of Krausz’s partition characterization for line graph
发表于 2025-3-27 16:40:57 | 显示全部楼层
Super Line Graphs and Super Line Digraphsf these vertices be adjacent if at least one of the edges in one set is adjacent in . to at least one of those in the other set. This new graph is called a line graph of index 2. Naturally, line graphs of index . are defined analogously, and they constitute the subject of this chapter and have the n
发表于 2025-3-27 20:30:03 | 显示全部楼层
发表于 2025-3-27 23:39:18 | 显示全部楼层
发表于 2025-3-28 05:50:05 | 显示全部楼层
Lowell W. Beineke,Jay S. BaggaThe first monograph devoted exclusively to Line Graphs and Line Digraphs.Provides a comprehensive, historical and up-to-date reference on the subject.Covers line graphs and line digraphs from their or
发表于 2025-3-28 07:20:23 | 显示全部楼层
发表于 2025-3-28 13:02:39 | 显示全部楼层
Spectral Properties of Line Graphshs’s theorem which states that eigenvalues of the adjacency matrix of a line graph are never less than −2. This feature pervades this chapter, culminating in a powerful theorem of Cameron, Goethals, Seidel, and Shult on root systems.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-26 17:28
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表