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

The maximum clique problem is a classical problem in combinatorial optimization which finds important applications in different domains. In this paper we try to give a survey of results concerning algorithms, complexity, and applications of this problem, and also provide an updated bibliography. Of course, we build upon precursory works with similar goals [39, 232, 266].

The maximum clique problem

Landmarks in graphs

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.

Let S be a metric space under the distance function d. A metric basis is a subset B ⊆ S such that d(b, x) = d(b, y) for all b ϵ B implies x = y. It is shown that for Euclidean distance, the minimal metric bases for the digital plane are just the sets of three noncollinear points; but for city block or chessboard distance, the digital plane has no finite metric basis. The sizes of minimal metric bases for upright digital rectangles are also derived, and it is shown that there exist rectangles having minimal metric bases of any size ≥ 3.

Metric bases in digital geometry

Discrepancies between metric dimension and partition dimension of a connected graph

Semi extremal properties of the degree distance of a graph

http://lori.academicdirect.org/cites/200911.pdf

Properties of connected graphs having minimum degree distance

Three hundred and sixty-nine problems with fully worked solutions for courses in computer science, combinatorics, and graph theory, designed to provide graded practice to students with as little as a high school algebra background. Originally used to prepare Rumanian candidates for participation in the International Mathematical Olympiads, this book includes both simple problems and complex ones, arranged according to subject. It provides various levels of problems, some of which had been previously available only in research journals. All details of the proofs are given in the solutions.

Ioan Tomescu

Papers

Metric bases in digital geometry

Discrepancies between metric dimension and partition dimension of a connected graph

Semi extremal properties of the degree distance of a graph

Properties of connected graphs having minimum degree distance

Problems in combinatorics and graph theory