Independence and matching numbers of some token graphs

zbMath1439.05187arXiv1606.06370MaRDI QIDQ5109075

Luis Manuel Rivera, Walter Carballosa, Hernán de Alba, Jesús Leaños

Publication date: 7 May 2020

Full work available at URL: https://arxiv.org/abs/1606.06370

zbMATH Keywords

matching numbers\(k\)-token graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (2)

The automorphism groups of some token graphs ⋮ Spectral properties of token graphs

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spectra of symmetric powers of graphs and the Weisfeiler-Lehman refinements
• Some new distance-4 constant weight codes
• Symmetric squares of graphs
• The \((n^ 2-1)\)-puzzle and related relocation problems
• The Johnson graph \(J(d,r)\) is unique if \((d,r)\neq (2,8)\)
• A linear-time algorithm for the feasibility of pebble motion on trees
• The packing number of the double vertex graph of the path graph
• Survey of double vertex graphs
• On the chromatic number, colorings, and codes of the Johnson graph
• Token graphs
• A generalisation of Johnson graphs with an application to triple factorisations
• Regularity and planarity of token graphs
• Non-isomorphic graphs with cospectral symmetric powers
• The connectivity of token graphs
• The complexity of change
• Cohen-Macaulayness of triangular graphs
• Reducibility among Combinatorial Problems
• Paths, Trees, and Flowers
• Reconfigurations in Graphs and Grids

This page was built for publication: Independence and matching numbers of some token graphs