Matchings in starlike trees

DOI10.1016/S0893-9659(01)00054-4zbMath0985.05037OpenAlexW2050331803MaRDI QIDQ5950594

Oswaldo Araujo, Ivan Gutman, Juan Rada

Publication date: 2 January 2002

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0893-9659(01)00054-4

zbMATH Keywords

orderingextremal graphsmatchingsstarlike trees

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (8)

Consecutive chemical trees with respect to energy of graph ⋮ Extremal polyomino chains on \(k\)-matchings and \(k\)-independent sets ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Characteristics polynomial of normalized Laplacian for trees ⋮ Graphs cospectral with starlike trees ⋮ Extremal energies of trees with a given domination number ⋮ Vertex-degree-based topological indices over starlike trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the ordering of graphs with respect to their matching numbers
• An introduction to matching polynomials
• On acyclic conjugated molecules with minimal energies
• On minimal energy ordering of acyclic conjugated molecules
• On the theory of the matching polynomial

This page was built for publication: Matchings in starlike trees