Title
Randić structure of a graph
Abstract
Let g be a collection of graphs with n vertices. We present a simple description of [G]χ = {H ∈ g : χ(H) = χ(G)} where χ denotes the Randic´ index. We associate to G a Q-linear map ρ : Qm → Qk (for some integers k, m depending on g) such that the kernel of ρ contains the necessary information to describe [G]χ in terms of linear equations. These results provide precise tools for analyzing the behavior of χ on a collection of graphs.
Year
DOI
Venue
2003
10.1016/S0166-218X(02)00505-X
Discrete Applied Mathematics
Keywords
Field
DocType
simple description,n vertex,linear equation,q-linear map,necessary information,integers k,precise tool,linear equations,indexation
Graph theory,Integer,Kernel (linear algebra),Linear equation,Graph,Discrete mathematics,Linear independence,Combinatorics,Vertex (geometry),Isomorphism,Mathematics
Journal
Volume
Issue
ISSN
128
2-3
Discrete Applied Mathematics
Citations 
PageRank 
References 
0
0.34
4
Authors
2
Name
Order
Citations
PageRank
Juan Rada13610.02
Carlos Uzcátegui2649.18