位置：成果数据库 > 期刊 > 期刊详情页
Sharp bounds on Zagreb indices of cacti with k pendant vertices
  • ISSN号：0354-5180
  • 期刊名称：Filomat
  • 时间：2012
  • 页码：1189-1200
  • 相关项目：图中结构与全局参数
作者： Li, Shuchao|Yang, Huangxu|Zhao, Qin|
同期刊论文项目
图中结构与全局参数
期刊论文 30 获奖 1
同项目期刊论文
Ordering of trees with fixed matching number by the Laplacian coefficients
Circumferences of k-Connected Graphs Involving Independence Numbers
On the spectral radius of weighted trees with given number of pendant vertices and a positive weight
Permanental Bounds for the Signless Laplacian Matrix of a Unicyclic Graph with Diameter d
On the signless Laplacian index of cacti with a given number of pendant vertices
On the extremal values of the eccentric distance sum of trees
Further analysis on the total number of subtrees of trees
EDGE-GRAFTING THEOREMS ON PERMANENTS OF THE LAPLACIAN MATRICES OF GRAPHS AND THEIR APPLICATIONS
Sums of Powers of the Degrees of Graphs with k Cut Edges
Sharp upper bounds on Zagreb indices of bicyclic graphs with a given matching number
On the (Laplacian) spectral radius of weighted trees with fixed matching number q and a positive wei
On the spectral radius of weighted unicyclic graphs with a positive weight set
Cycles in Conditional Faulty Enhanced Hypercube Networks
故障折叠超立方体中的路和圈(英文)
Vertex-Fault-Tolerant Cycles Embedding on Enhanced Hypercube Networks
Paths and cycles embedding on faulty enhanced hypercube networks
Every 3-connected {K (1,3),N (3,3,3)}-free graph is Hamiltonian
An optimal binding number condition for bipancyclism
Two Forbidden Subgraph Pairs for Hamiltonicity of 3-Connected Graphs
On the sum-connectivity index of unicyclic graphs with k pendent vertices
Some bounds on the largest eigenvalues of graphs
On the signless Laplacian index of unicyclic graphs with fixed diameter
Sharp bounds on the zeroth-order general Randic indices of conjugated bicyclic graphs
On tricyclic graphs whose second largest eigenvalue does not exceed 1
Permanental bounds for the signless Laplacian matrix of bipartite graphs and unicyclic graphs
ORDERING TREES BY THE MINIMAL ENTRIES OF THEIR DOUBLY STOCHASTIC GRAPH MATRICES
On the zeroth-order general Randic index
The least eigenvalue of the signless Laplacian of the complements of trees
Endpoint extendable paths in dense graphs