Sharp bounds for the Zagreb indices of bicyclic graphs with k-pendant vertices.
Qin ZhaoShuchao LiPublished in: Discret. Appl. Math. (2010)
Keyphrases
- weighted graph
- labeled graphs
- random graphs
- attributed graphs
- undirected graph
- adjacency matrix
- average degree
- lower bound
- maximal cliques
- graph matching
- connected graphs
- upper bound
- planar graphs
- connected subgraphs
- error bounds
- hamiltonian cycle
- high quality
- directed edges
- edge weights
- graph theoretic
- graph databases
- graph structures
- vertex set
- graph mining
- graph theory
- shortest distance
- maximum cardinality
- graph kernels
- subgraph isomorphism
- phase transition
- directed graph
- shortest path