2. 您的位置
3. 首页
4. 会议论文
5. Resistance Distance and Kirchhoff Index of Graphs

Resistance Distance and Kirchhoff Index of Graphs

来源 :第六届图论与组合算法国际研讨会(The 6th International Symposium on Graph The | 被引量 : 0次 | 上传用户：a499716595

【摘 要】

：

　　In this talk,we give formulas for resistance distances and Kirchhoff indices of some composite graphs,and obtain formulas for the Kirchhoff index,Laplacian-

【作 者】

：

Jiang Zhou 

【机 构】

：

CollegeofScience,HarbinEngineeringUniversityHarbin150001,P.R.China

【出 处】

：

第六届图论与组合算法国际研讨会(The 6th International Symposium on Graph The

【发表日期】

：

2015年7期

下载到本地 , 更方便阅读

下载此文 赞助VIP

声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架

论文部分内容阅读

　　In this talk,we give formulas for resistance distances and Kirchhoff indices of some composite graphs,and obtain formulas for the Kirchhoff index,Laplacian-energy-like invariant and Laplacian Estrada index of the line graph of a semiregular graph.We also give some applications of resistance distances to graph spectra.

其他文献

(V,R)-语言、(V,R)-半群、互联网络与图论

　　阐述(V,R)-语言、(V,R)-半群、拟简单图以及拟严格有向图等概念,建立(V,R)-语言、(V,R)-半群、互联网络与拟简单图、拟严格有向图以及随机图的关系,进而,以上领域互为工

会议

Perfect Matching Covers of Cubic Graphs

　　A perfect matching cover of a graph G is a set of perfect matchings of G such that each edge of G is contained in at least one member of it.Berge conjecture

会议

Some Results on Judicious Partitions of Graphs and Hypergraphs

　　Many classical graph partitioning problems ask for partitions of a graph(or a hypergraph)that optimize a single quantity.In judicious partitioning problems,

会议

A Characterization of Graphs Whose Mycielski Graphs Have Crossing Number at Most One

　　In this paper we deduce a necessary and sufficient condition for those graphs whose Mycielski graphs are planar.In addition,we deduce a necessary and suffic

会议

On the Existence of Rainbow Cliques in Edge-colored Graphs

　　An edge-colored graph H is called rainbow if e(H)= c(H),where e(H)is the number of edges in G and c(H)is the number of colors used.The rainbow number rb(G,H

会议

Automorphisms of Cayley Digraph of 2-genetic Groups of Prime-power Order

　　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

会议

Sharp Bounds on Multiplicative Zagreb Indices of k-trees

　　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

会议

Recent Development on Strong Edge Coloring

　　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

会议

Characteristic Polynomials of the Generalized Subdivision-edge Corona

　　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

会议

Per-spectral Characterizations of a Complete Graph and Its Some Edge-deleted Subgraphs

　　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

会议