Problems related to graph indices in trees

DOI10.1007/978-3-319-24298-9_1zbMath1354.05029OpenAlexW2466780729MaRDI QIDQ2957173

Hua Wang, László A. Székely, Stephan G. Wagner

Publication date: 25 January 2017

Published in: Recent Trends in Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-24298-9_1

zbMATH Keywords

inverse problemsdominating setWiener indexrandom treeHosoya indexrandic indexMerrifield-Simmons indexnumber of subtrees

Mathematics Subject Classification ID

Trees (05C05) Graph polynomials (05C31) Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (4)

Graphs with few total dominating sets ⋮ Analyzing lattice networks through substructures ⋮ Global regime for general additive functionals of conditioned Bienaymé-Galton-Watson trees ⋮ Trees with minimum number of infima closed sets

This page was built for publication: Problems related to graph indices in trees