小故事
发表于 2025-3-26 21:04:57
http://reply.papertrans.cn/59/5863/586234/586234_31.png
promote
发表于 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
evanescent
发表于 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
accordance
发表于 2025-3-27 20:30:03
http://reply.papertrans.cn/59/5863/586234/586234_36.png
BUOY
发表于 2025-3-27 23:39:18
http://reply.papertrans.cn/59/5863/586234/586234_37.png
EVADE
发表于 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
Guaff豪情痛饮
发表于 2025-3-28 07:20:23
http://reply.papertrans.cn/59/5863/586234/586234_39.png
加花粗鄙人
发表于 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.