Extremal Problems for Graphical Function-Indices and f-Weighted Adjacency Matrix
Xueliang Li, Danni Peng
Abstract
Let f (x, y) (f (x)) be a symmetric real function (real function) and G = (V, E) be a graph. Denote by di the degree of a vertex i in G. The graphical function-index
Topics & Concepts
Adjacency matrixMathematicsAdjacency listMatrix (chemical analysis)CombinatoricsFunction (biology)BiologyGraphGeneticsComposite materialMaterials scienceMatrix Theory and AlgorithmsStatistical and numerical algorithmsAdvanced Optimization Algorithms Research