On the Connectivity of Token Graphs of Trees (Q6045414): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.46298/dmtcs.7538 / rank
Normal rank
 
Property / cites work
 
Property / cites work: A generalisation of Johnson graphs with an application to triple factorisations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4029978 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectra of symmetric powers of graphs and the Weisfeiler-Lehman refinements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric squares of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-isomorphic graphs with cospectral symmetric powers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some new distance-4 constant weight codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularity and planarity of token graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cohen-Macaulayness of triangular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic number, colorings, and codes of the Johnson graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Token graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The packing number of the double vertex graph of the path graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of reconfiguration problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The connectivity of token graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The edge-connectivity of token graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing spectral bounds of the Heisenberg ferromagnet from geometric considerations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Johnson graph \(J(d,r)\) is unique if \((d,r)\neq (2,8)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Swapping labeled tokens on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3139277 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.46298/DMTCS.7538 / rank
 
Normal rank

Latest revision as of 17:59, 30 December 2024

scientific article; zbMATH DE number 7689828
Language Label Description Also known as
English
On the Connectivity of Token Graphs of Trees
scientific article; zbMATH DE number 7689828

    Statements

    On the Connectivity of Token Graphs of Trees (English)
    0 references
    0 references
    0 references
    30 May 2023
    0 references
    token graphs
    0 references
    connectivity
    0 references
    trees
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references