On the total weight of weighted matchings of segment graphs

MaRDI QIDQ1028836zbMATH OpenFDO

Authors Thomas Stoll, Jiang Zeng

Publication date 8 July 2009

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/130292, http://www.emis.de/journals/EJC/Volume_16/Abstracts/v16i1r56.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45)

Review text

Summary: We study the total weight of weighted matchings in segment graphs, which is related to a question concerning generalized Chebyshev polynomials introduced by \textit{M. Vauchassade de Chaumont} and \textit{G. Viennot} [Sémin. Lothar. Comb. 8, B081, 8 p. (1983; Zbl 0977.33500)] and, more recently, investigated by \textit{D. Kim} and \textit{J. Zeng} [Eur. J. Comb. 24, No. 5, 499--509 (2003; Zbl 1061.33010)]. We prove that weighted matchings with sufficiently large node-weight cannot have equal total weight.

Recommendations

• scientific article; zbMATH DE number 12050
• Gallai-Edmonds structure theorem for weighted matching polynomial
• Some results on graph parameters in weighted graphs
• A refined Gallai-Edmonds structure theorem for weighted matching polynomials
• Maximum vertex-weighted matching in strongly chordal graphs

This page was built for publication: On the total weight of weighted matchings of segment graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1028836)