Photo from archive.org
Abstract Let S n be the symmetric group on n-points. The k-point fixing graph F ( n , k ) is defined to be the graph with vertex set S… Click to show full abstract
Abstract Let S n be the symmetric group on n-points. The k-point fixing graph F ( n , k ) is defined to be the graph with vertex set S n and two vertices g, h of F ( n , k ) are joined if and only if g h − 1 fixes exactly k points. In this paper, we give a recurrence formula for the eigenvalues of a class of regular subgraphs of F ( n , k ) . By using this recurrence formula, we will determine the smallest eigenvalues for this class of regular subgraphs of F ( n , 1 ) for sufficiently large n.
Keywords:
point fixing;
fixing graph;
subgraphs point;
spectrum eigenvalues;
certain subgraphs;
eigenvalues certain
Journal Title: Linear Algebra and its Applications
Year Published: 2018
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Linear Algebra and its Applications
Year Published: 2018
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!