助手标题
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
共[142]条 当前为第1条到20条[由于搜索限制,当前仅支持显示前5页数据]
 

相关语句
line graph
Let G be a simple connected graph with n vertices and m edges, LG be the line graph of G and λ1 (LG) ≥ λ2 (LG) ≥ … ≥ λm (LG) be the eigenvalues of the graph LG.
      
In this paper, the range of eigenvalues of a line graph is considered.
      
But by using the concept of edge cochromatic number it is proved that if G is the line graph of a connected triangle-free graph with ω(G)>amp;lt;5 and G≠K4, then z(G)≥χ(G)-2.
      
It also allows for sensible definition of a line graph (the medial graph), particularly useful for domains consisting of connected channels, and not reliant on symmetries of the domains.
      
A special kind of embedding of graph into itsn-th iterated line graph, called incidence embedding, is studied.
      
In this paper, we give a best possible Ore-like condition for a graph so that its line graph is pancyclic or vertex pancyclic.
      
This paper shows that for a connected balanced digraph D and its line digraph L, if D is optimally super edge-connected, then κ1(L) = 2λ1(D), and that for a connected graph G and its line graph L, if one of κ1(L) and λ2(G) exists, then κ1(L) = λ2(G)
      
Let K be the quasi-Laplacian matrix of a graph G and B be the adjacency matrix of the line graph of G, respectively.
      
We study the cases, when a critical edge is removed from the line graph of a bipartite graph or from the complement of such a graph.
      
On-line graph coloring of $${\mathbb{P}_5}$$-free graphs
      
The concept of line perfection of a graph is defined so that a simple graph is line perfect if and only if its line graph is perfect in the usual sense.
      
In this paper we consider the problem of on-line graph coloring.
      
In an instance of on-line graph coloring, the nodes are presented one at a time.
      
The performance ratio of an on-line graph coloring algorithm for a class of graphsC is maxG ∈C(A(G)/χ(G)).
      
First Fit does as well as any on-line algorithm ford-inductive graphs: we show that, for anyd and any on-line graph coloring algorithmA, there is ad-inductive graph that forcesA to use Ω(d logn) colors to colorG.
      
We also examine on-line graph coloring with lookahead.
      
A pseudo-line graph(Γ, E) is a graph for which the vertices are the pseudo-lines of Γ and the edges are some unordered pairs of pseudo-lines of Γ .
      
We show that a graph is planar if and only if it is isomorphic to a diamond-free pseudo-line graph.
      
The anticipation of the discrepancy at skeletal maturity is achieved with the Green and Anderson data, either with the arithmetic method, the growth remaining charts, or the Moseley straight line graph.
      
It is shown that every edge-clique graph is a clique graph, and that ifG is either an interval graph or a line graph, then so too isK(G).
      
 

首页上一页12345下一页尾页 

 
CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社