Combinatorics and Graphs.

Intro -- Contents -- Preface -- The Eigenvalues of Oppositeness Graphs in Buildings of Spherical Type -- On the Dynamic Chromatic Number of Graphs -- Signed Domination of Graphs and (0, 1)-Matrices -- Totally Balanced Test-Control Incomplete Crossover Designs and Their Statistical Applications -- Euclidean Designs and Coherent Configurations -- Maps with Highest Level of Symmetry That Are Even More Symmetric Than Other Such Maps: Regular Maps with Largest Exponent Groups -- A Note on Finite Groups Determined by a Combinatorial Property -- On the Zeros of Domination Polynomial of a Graph -- List Coloring of Graphs with Cycles of Length Divisible by a Given Integer -- On Generalized Lucas Sequences -- On Cycle-Free Lattices -- On the Rational Independence Roots -- Graphs Cospectral with Kneser Graphs -- A Survey of Alternating Permutations -- The Spectrum of the McKay-Miller-Širáň graphs -- A Theorem on Incidence Matrices and Quasirandom Hypergraphs -- Combinatorial Estimates by the Switching Method -- Characterizing Completely Regular Codes from an Algebraic Viewpoint -- On the Real Unbiased Hadamard Matrices -- The Proportion of Various Graphs in Graph-Designs -- On Unique Independence Weighted Graphs.

Description based on publisher supplied metadata and other sources.

Electronic reproduction. Ann Arbor, Michigan : ProQuest Ebook Central, 2024. Available via World Wide Web. Access may be limited to ProQuest Ebook Central affiliated libraries.