The Theory of Matrices. By F R. Gantmacher. Two volumes, pp. 374 and 276. 1959. (Translated from the Russian by K. A. Hirsch; Chelsea Publishing Company, New York)

A graph labeling is an assignment of integers to the vertices or edges, or both, subject to certain conditions. Graph labelings were first introduced in the late 1960s. In the intervening years dozens of graph labelings techniques have been studied in over 1000 papers. Finding out what has been done for any particular kind of labeling and keeping up with new discoveries is difficult because of the sheer number of papers and because many of the papers have appeared in journals that are not widely available. In this survey I have collected everything I could find on graph labeling. For the convenience of the reader the survey includes a detailed table of contents and index.

/pdf/a-dynamic-survey-of-graph-labeling-198znmwxtq.pdf

A Dynamic Survey of Graph Labeling

In One Line and Close. Permutations as Linear Orders. Descents Alternating Runs Alternating Subsequences In One Line and Anywhere. Permutations as Linear Orders. Inversions. Inversions Inversion in Permutations of Multisets In Many Circles. Permutations as Products of Cycles. Decomposing a Permutation into Cycles Type and Stirling Numbers Cycle Decomposition versus Linear Order Permutations with Restricted Cycle Structure In Any Way but This. Pattern Avoidance. The Basics. The Notion of Pattern Avoidance Patterns of Length Three Monotone Patterns Patterns of Length Four The Proof of the Stanley-Wilf Conjecture In This Way but Nicely. Pattern Avoidance. Follow-Up. Polynomial Recurrences Containing a Pattern Many Times Containing a Pattern a Given Number of Times Mean and Insensitive. Random Permutations. The Probabilistic Viewpoint Expectation Variance and Standard Deviation An Application: Longest Increasing Subsequences Permutations versus Everything Else. Algebraic Combinatorics of Permutations. The Robinson-Schensted-Knuth Correspondence Posets of Permutations Simplicial Complexes of Permutations Get Them All. Algorithms and Permutations. Generating Permutations Stack Sorting Permutations Variations of Stack Sorting How Did We Get Here? Permutations as Genome Rearrangements. Introduction Block Transpositions Block Interchanges Block Transpositions Revisited Solutions to Odd-Numbered Exercises References List of Frequently Used Notation Index Exercises, Problems, and Problem Solutions appear at the end of each chapter.

Combinatorics of Permutations

G. Clar 6n Rule versus Hückel 4n + 2 Rule 3464 H. Hydrocarbons versus Heteroatomic Systems 3465 IV. Hidden Treasures of Kekulé Valence Structures 3466 A. Conjugated Circuits 3467 B. Innate Degree of Freedom 3470 C. Clar Structures 3472 V. Graph Theoretical Approach to Chemical Structure 3473 A. Metric 3473 B. Chemical Graphs 3473 C. Isospectral Graphs 3473 D. Embedded Graphs 3475 E. Partial Ordering 3476 VI. On Enumeration of Benzenoid Hydrocarbons 3477 VII. Kekulé Valence Structures Count 3479 A. Non-branched Cata-condensed Benzenoids 3481 B. Branched Cata-condensed Benzenoids 3482 C. Benzenoid Lattices 3482 D. Peri-condensed Benzenoids 3483 E. Miscellaneous Benzenoids 3484 F. The Approach of Platt 3485 G. Computer Programs for Calculating K 3485 H. Transfer-Matrix Method 3486 I. Use of Recursion Relations 3486 J. Use of Signed Matrices 3487 VIII. Enumeration of Conjugated Circuits 3488 IX. Approximate Approaches versus Ambitious Computations 3490

/pdf/aromaticity-of-polycyclic-conjugated-hydrocarbons-3jl41mcpqo.pdf

Aromaticity of polycyclic conjugated hydrocarbons.

Determine the value of the variable in each equation.

Basic Algebra = 代数学入門

Given two graphs G1, with vertices 1, 2, ..., n and edges e1, e2, ..., em, and G2, the edge corona G1 | G2 of G1 and G2 is defined as the graph obtained by taking m copies of G2 and for each edge ek = ij of G, joining edges between the two end-vertices i, j of ek and each vertex of the k-copy of G2. In this paper, the adjacency spectrum and Laplacian spectrum of G1 | G2 are given in terms of the spectrum and Laplacian spectrum of G1 and G2, respectively. As an application of these results, the number of spanning trees of the edge corona is also considered.

/pdf/the-spectrum-of-the-edge-corona-of-two-graphs-1re17zlkos.pdf

The spectrum of the edge corona of two graphs

On the second largest Laplacian eigenvalues of graphs

Forcing matching numbers of fullerene graphs

Finite transition matrices for permutations avoiding pairs of length four patterns

Uniform designs (UDs) have been widely used in various fields. Tradition- ally they were generated by so-called good lattice point (glp )s ets. In this paper, we propose a new approach based on cyclic Latin squares (CLS). The UDs generated have much smaller discrepancies than those proposed by Wang and Fang (1981). A threshold accepting algorithm is employed for finding the CLS with smallest

/pdf/uniform-designs-based-on-latin-squares-17efz8miag.pdf

Wai Chee Shiu

Papers

The spectrum of the edge corona of two graphs

On the second largest Laplacian eigenvalues of graphs

Forcing matching numbers of fullerene graphs

Finite transition matrices for permutations avoiding pairs of length four patterns

Uniform designs based on latin squares