scientific article

zbMATH Open1199.05082MaRDI QIDQ3649826FDOQ3649826

Ai Lian Chen, Fuji Zhang

Publication date: 4 December 2009

Title of this publication is not available (Why is that?)

zbMATH Keywords

perfect matchingdistance in graphrandom chain

Mathematics Subject Classification ID

Distance in graphs (05C12) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (18)

• The minimum Kirchhoff index of phenylene chains
• Extremal phenylene chains with respect to the coefficients sum of the permanental polynomial, the spectral radius, the Hosoya index and the Merrifield-Simmons index
• On computing some degree based topological indices for backbone DNA networks
• The expected values of Wiener indices in random polycyclic chains
• Computing the expected subtree number of random hexagonal and phenylene chains based on probability matrices
• Extremal phenylene chains with respect to detour indices
• On the number of perfect matchings in random polygonal chains
• Enumeration of the Gutman and Schultz indices in the random polygonal chains
• Comparison of the Wiener and Kirchhoff indices of random pentachains
• Perfect matchings in random octagonal chain graphs
• Enumeration of Wiener indices in random polygonal chains
• Hosoya and Merrifield-Simmons indices in random polyphenyl chains
• Merrifield-simmons index in random phenylene chains and random hexagon chains
• The comparative analysis of two molecular indices in random polyphenyl and spiro chains
• Hosoya and Merrifleld-Simmons indices in random polyphenyl chains
• Wiener index of graphs with radius two
• Comparing the excepted values of atom-bond connectivity and geometric-arithmetic indices in random spiro chains
• Extremal phenylene chains with respect to the Mostar index

This page was built for publication:

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