位置：成果数据库 > 期刊 > 期刊详情页
A Unified Approach to Extremal Trees with Respect to Geometric-Arithmetic, Szeged and Edge Szeged In
  • ISSN号：0340-6253
  • 期刊名称：MATCH-Communications in Mathematical and in Comput
  • 时间：0
  • 页码：691-704
  • 语言：英文
  • 相关项目：赋权图中重圈和重割的存在性
作者： Zhang, Shenggui|Hua, Hongbo|
同期刊论文项目
赋权图中重圈和重割的存在性
期刊论文 24 会议论文 2
同项目期刊论文
Graphs with given number of cut vertices and extremal Merrifield-Simmons index
Applications of graph theory in protein structure identification
Vertex-neighbor-integrity of composition graphs of cycles
Heavy cycles and spanning trees with few leaves in weighted graphs
The signless Laplacian spectral radius of tricyclic graphs and trees with k pendant vertices
一类双圈图的两种指标的排序
Further results on the eccentric distance sum
Sharp bounds for the largest eigenvalue of the signless Laplacian of a graph
On extremal weighted digraphs with no heavy paths
Extremal graphs with given order and the rupture degree
Integral complete multipartite graphs Ka1.p1,a2.p2,...,as.ps with s=5, 6
Extreme values of the sum of squares of degrees of bipartite graphs
Degree sum conditions for oriented forests in digraphs
Hamilton cycles in claw-heavy graphs
The Laplacian Spread of Tricyclic Graphs
Infinitely many pairs of cospectral integral regular graphs
两类图及其线图的Wiener指数
聚苯链的Hosoya指标的计算
赋权无三角形图中过给定顶点的重圈
用广义线图构造整谱图