On the extremal geometric-arithmetic graphs with fixed number of vertices having minimum degree.
Milica Milivojevic DanasLjiljana PavlovicPublished in: Ann. Oper. Res. (2022)
Keyphrases
- fixed number
- random graphs
- graph theory
- weighted graph
- graph theoretical
- undirected graph
- labeled graphs
- maximal cliques
- hamiltonian cycle
- spanning tree
- graph theoretic
- attributed graphs
- minimum cost
- planar graphs
- degree distribution
- finite number
- average degree
- adjacency matrix
- minimum weight
- partial ordering
- clustering coefficient
- connected subgraphs
- connected dominating set
- geometric structure
- graph model
- phase transition
- directed edges
- graph clustering
- minimum length
- edge weights
- geometric constraints
- graph structure
- maximum cardinality
- connected graphs
- directed graph