The (weighted) vertex PI index of unicyclic graphs

来源 :第五届全国组合数学与图论大会 | 被引量 : 0次 | 上传用户：abkkk123

【摘要】

：

　　In [1], A.Ili(c)et al.introduced weighted vertex PI index,PIw(G) =Σe=uv∈E (deg(u) + deg(v))(nu(e) + nv(e)),where deg(u) denotes the vertex degree of u and

【出处】

：

第五届全国组合数学与图论大会

【发表日期】

：

2012年7期

下载到本地 , 更方便阅读

下载此文赞助VIP

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

论文部分内容阅读

　　In [1], A.Ili(c)et al.introduced weighted vertex PI index,PIw(G) =Σe=uv∈E (deg(u) + deg(v))(nu(e) + nv(e)),where deg(u) denotes the vertex degree of u and nu(e) denotes the number of vertices of G whose distance to the vertex u is smaller than the distance to the vertex v.

其他文献

The minimal Laplacian spectral radius of trees with given matching number

　　Let Jn,β denote the set of trees on n vertices with fixed matching number β, where n =kβ + l(k ≥ 2).In this paper, the tree with minimal Laplacian radiu

会议

Milnor-Witt K-theory and Tensor Powers of the Augmentation Ideal of (Z)[F×]

　　Let F be a field of characteristic not equal to 2.We describe the relation between the non-negative dimensional Milnor-Witt K-theory of F and the tensor alg

会议

K-theoryGrothendieck-Witt ringGroup ring

Star arboricity and k-star arboricity of graphs

　　A star forest is a forest whose components are stars.The star arboricity of a graph G, denoted by sa(G), is the minimum number of edge-disjoint star forests

会议

Star arboricityk-star arboricityLinear k-arboricityCubic graphsSubcubic grap

The least eigenvalue of signless Laplacian of non-bipartite unicyclic graphs with given pendant vert

　　Let G =(V, E) be a simple graph with vertex set V ={v1, v2,..., vn} and edge set E =E(G).The adjacency matrix of G is defined to be a matrix A(G) =(aij), wh

会议

4-ordered Hamiltonicity of the Complete Expansion graph of some Cayley graph

　　It will be proved that the Complete Expansion graph of And(k)(k6) is 4-ordered Hamiltonian graph by method of classification discuss.

会议

Andrasfai graphComplete expansion graphk-ordered hamiltonian graph

Bicoloured Ordered Trees and Restricted Permutations

　　Let σ ∈ Sk and T ∈ Sn be permutations.We say τ avoids σ if there do not exist 1 ≤ x1 ≤ x2 ≤ … ≤ xk ≤ n such that τ(xi) < τ(xj) if and only if

会议

Graph-supermagic coverings of the Cartesian product of graphs

　　The Cartesian product of two graphs G1 and G2 is denoted by G1 × G2.The concept of an H-supermagic covering of G arises from three connected areas: magic s

会议

Semimodules and preservers of rank two traceless symmetric Boolean matrices

　　Let B denote the two element Boolean algebra.For each integer n ≥ 2, let Zn(B) be the semi-module of all n-square symmetric Boolean matrices with zero diag

会议

Some results on the decomposition of graphs

　　Let k ≥ 2 be an integer.A k-decomposition (G1,…, Gk) of a graph G is a partition of its edge set to form k spanning subgraph G1,…, Gk.That is, each Gi ha

会议

Multicolor bipartite Ramsey number of C4 and large Kn,n

　　Let brk(C4;Kn,n) be the smallest N such that if all edges of KN,N are colored by k + 1 colors, then there is a monochromatic C4 in one of the first k colors

会议

The (weighted) vertex PI index of unicyclic graphs

其他学术论文