摘要
对连通图G,以C_i(G),■(G)分别表G的有i条边的连通支撑子图之集与连通子图之集,以C^i(G),(?)(G)分别表G的顶点数为i的子树集与连通子图之集.本文讨论了这四类子图簇对若干基本参数及端点数的介值性,从而对已有的一些结果作了若干有意义的拓广.
Given a connected simple graph G of order p and size q, suppose G_i(G)={H(?)G| H is spanned and connected, |E(H)|=i},C_i(G)={H(?)G|H is spanned and connected,|E(H)|=i},C_i(G)={H(?)G|H is connected, |E(H)|=i}C^i(G)={H(?)G| H is a subtree of G with order i}C^i(G)={H(?)G|H is connected of order i} several interpolation properties of the four classes above with respect to some basic graphic parameters, say κ, κ', α,β,α',β',x,x',are proved by using a simple fact called the interpolation principle. Some interpolation theorems about the number of end-vertices of graphs are also given. Among them the numbers (other than zero) of end-vertices of subgraphs in C_i(G) consisting of a consecutive integer set are dislussed.
出处
《应用数学》
CSCD
北大核心
1991年第1期64-69,共6页
Mathematica Applicata
