Contents

Ars Combinatoria

  • Research article

A Unified Approach to the Extremal Trees without Perfect Matching for Different Indices

Huiging Liu1, Mei Lu2
1School of Mathematics and Computer Science, Hubei University, Wuhan 430062, China
2Department of Mathematical Sciences, Tsinghua University, Beijing 100084, China
  • Published: 31/01/2012

Abstract

In this paper, we present a unified and simple approach to extremal acyclic graphs without perfect matching for the energy, the Merrifield-Simmons index and Hosoya index.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Huiging Liu, Mei Lu. A Unified Approach to the Extremal Trees without Perfect Matching for Different Indices[J], Ars Combinatoria, Volume 103. 505-518. .