论文部分内容阅读
1993年,Klein和Randi(c)提出了图的电阻距离的概念,且指出电阻距离是定义在图上距离函数,是图的重要的不变量。对于一些复杂图来说,计算其电阻距离非常困难。文中定义了一类新的图运算：轮扩展图。
轮扩展图的电阻距离及Kirchhoff指数
【摘 要】
：
1993年,Klein和Randi(c)提出了图的电阻距离的概念,且指出电阻距离是定义在图上距离函数,是图的重要的不变量。对于一些复杂图来说,计算其电阻距离非常困难。文中定义了
【机 构】
：
计算机与通信学院,甘肃,兰州,730050
【出 处】
：
第六届图论与组合算法国际研讨会(The 6th International Symposium on Graph The
【发表日期】
：
2015年7期
其他文献
A group is called 2-genetic if each normal subgroup of the group can be generated by two elements.For an odd prime p and a positive integer n,let G be a non
会议
Let G be a graph with vertex set V(G)and edge set E(G).The first generalized multiplicative Zagreb index of G is defined as ∏1;c(G)=∏v∈V(G)d(v)c for a re
会议
A strong edge coloring is an edge coloring such that every color class is an induced matching.In other words,every path with three edges has three distinct
会议
Let G be a graph with m edges.The subdivision graph(S)(G)of G is the graph obtained by inserting a new vertex into every edge of G.Denote by I(G)the set of
会议
Let G be a graph,and let A(G)denote the adjacency matrix of G.The permanental polynomial of G is defined as π(G,x)=per(xI-A(G)).The permanental spectrum of
会议
In this talk,we give formulas for resistance distances and Kirchhoff indices of some composite graphs,and obtain formulas for the Kirchhoff index,Laplacian-
会议
Being motivated in terms of mathematical concepts from the theory of electrical networks,Klein and Ivanciuc introduced and studied a new graph-theoretic cyc
会议
It is well-known that the n-dimensional hypercube Qn is one of the most versatile and efficient interconnection network architecture yet discovered for buil
会议
A linear k-forest of an undirected graph G is a subgraph of G whose components are paths with lengths at most k.The linear k-arboricity of G,denoted by lak(
会议
Some sharp bounds of the adjacency spectral radius,the Laplacian spectral radius,the signless Laplacian spectral radius,the distance spectral radius,the dis
会议