Login / Signup
Lower bounds for the geometric-arithmetic index of graphs with pendant and fully connected vertices.
Monica Bianchi
Alessandra Cornaro
José Luis Palacios
Anna Torriero
Published in:
Discret. Appl. Math. (2019)
Keyphrases
</>
fully connected
lower bound
maximal cliques
conditional random fields
scale free
query graph
objective function
index structure
weighted graph
undirected graph
labeled graphs
neural network
random walk
generative model
radial basis function