Extremal polyphenyl spiders concerning k-matchings and k-independent sets.

MaRDI QIDQ2936697zbMATH OpenFDO

Authors Xiaoling Ma, Hong Bian, Haizheng Yu

Publication date 6 January 2015

zbMATH Keywords

\(k\)-independent set\(k\)-matchingpolyphenyl spider

Mathematics Subject Classification ID

Applications of graph theory (05C90) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Extremal polyphenyl chains concerning k-matchings and k-independent sets.
• Extremal hexagonal chains concerning k-matchings and k-independent sets
• Extremal polyomino chains on k-matchings and k-independent sets
• Extremal pentagonal chains on \(k\)-matching
• Extremal double hexagonal chains with respect to k-matchings and k-independent sets

Cited in

(3)

• Complete Forcing Numbers of Polyphenyl Systems
• Extremal polygonal cactus chain concerning k-independent sets.
• Extremal polyphenyl chains concerning k-matchings and k-independent sets.

This page was built for publication: Extremal polyphenyl spiders concerning \(k\)-matchings and \(k\)-independent sets.

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