J. Moon

发表

Introduction to Combinatorial Mathematics.

C. L. Liu, J. Moon, G. Dantzig, 1971 .

On cliques in graphs

J. Moon, L. Moser, 1965 .

Random walks on random trees

J. Moon, 1973, Journal of the Australian Mathematical Society.

On Sets of Consistent Arcs in a Tournament

J. Moon, P. Erdös, 1965, Canadian Mathematical Bulletin.

On the Number of Complete Subgraphs of a Graph

J. Moon, 1965, Canadian Mathematical Bulletin.

On Generalized Tournament Matrices

J. Moon, N. Pullman, 1970 .

Topics on tournaments

J. Moon, 1968 .

Relations between packing and covering numbers of a tree

J. Moon, A. Meir, 1975 .

On the Altitude of Nodes in Random Trees

J. Moon, A. Meir, 1978, Canadian Journal of Mathematics.

On the thickness of the complete bipartite graph

J. Moon, L. Beineke, F. Harary, 1964, Mathematical Proceedings of the Cambridge Philosophical Society.

Counting labelled trees

J. Moon, 1970 .

A matrix reduction problem

J. Moon, L. Moser, 1966 .

On Subtournaments of a Tournament

J. Moon, 1966, Canadian Mathematical Bulletin.

AN EXTENSION OF LANDAU'S THEOREM ON TOURNAMENTS

J. Moon, 1963 .

Simple paths on polyhedra.

J. Moon, L. Moser, 1963 .

On Level Numbers of t-Ary Trees

J. Moon, 1983 .

On a Problem in Graph Theory

Paul Erdös, Andras Hajnal, J. Moon, 1963, The Mathematical Gazette.

The expected node-independence number of random trees

J. Moon, A. Meir, 1973 .

On maximal transitive subtournaments

J. Moon, 1971, Proceedings of the Edinburgh Mathematical Society.

On Independent Complete Subgraphs in a Graph

J. Moon, 1968, Canadian Journal of Mathematics.

The number of labeled k-trees

J. Moon, 1969 .

Some packing and covering theorems

J. Moon, L. Moser, 1967 .

Cutting down random trees

A. Meir, J. Moon, A. Meir, 1970, Journal of the Australian Mathematical Society.

Statistical tests on two characteristics of the shapes of cluster diagrams

J. Moon, M. Dale, 1988 .

On the Distribution of Crossings in Random Complete Graphs

J. Moon, J. W. Moon, 1965 .

On the Distribution of 4-Cycles in Random Bipartite Tournaments

J. Moon, L. Moser, L. Moser, 1962, Canadian Mathematical Bulletin.

Combinatorics: The distance between nodes in recursive trees

J. Moon, J. W. Moon, 1974 .

Walks and cycles on a digraph with application to population dynamics

J. Moon, P. D. Driessche, Zhisheng Shuai, 2014 .

Almost all Graphs have a Spanning Cycle

J. Moon, 1972, Canadian Mathematical Bulletin.

Weakening arcs in tournaments

John W. Moon, Denis Hanson, J. Moon, 2004, J. Graph Theory.

On the Branch‐Sizes of Rooted Unlabeled Trees a

J. Moon, A. Meir, 1989 .

The outer-distance of nodes in random trees

J. Moon, A. Meir, 1981 .

On generic forms of complementary graphs

S. D. Bedrosian, J. Moon, 1983 .

On Round-Robin Tournaments with a Unique Maximum Score and Some Related Results

J. Moon, Y. Malinovsky, 2022, 2208.14932.

Postnikov Identities and Seo ’ s Formulas

J. Moon, 2006 .

On Round-Robin Tournaments with a Unique Maximum Score and Some Related Results

J. Moon, Y. Malinovsky, 2022, 2208.14932.

Almost all Graphs have a Spanning Cycle

J. Moon, 1972, Canadian Mathematical Bulletin.

On the diameter of a graph.

J. Moon, J. W. Moon, 1965 .

On Hamiltonian bipartite graphs

J. Moon, L. Moser, L. Moser, 1963 .

Embedding tournaments in simple tournaments

John W. Moon, J. Moon, 1972, Discret. Math..

On path entropy functions for rooted trees

John W. Moon, Amram Meir, J. Moon, 1995, Discret. Math..

The second moment of the complexity of a graph

J. Moon, J. W. Moon, 1964 .

On random mapping patterns

John W. Moon, Amram Meir, J. Moon, 1984, Comb..

On maximal independent sets of nodes in trees

John W. Moon, Amram Meir, J. Moon, 1988, J. Graph Theory.

The number of trees with a 1-factor

John W. Moon, J. Moon, 1987, Discret. Math..

The Maximum Diameter of a Convex Polyhedron

J. Moon, E. Jucovic, 1965 .

On negative dependence inequalities and maximal scores in round-robin tournaments

J. Moon, Y. Malinovsky, 2021, Statistics & Probability Letters.

Some Enumerative Results on Series-Parallel Networks

John W. Moon, J. Moon, 1987 .

The permuted analogues of three Catalan sets

J. Moon, M. Dale, J. W. Moon, 1993 .

On minimal n-universal graphs

J. Moon, J. W. Moon, 1965, Proceedings of the Glasgow Mathematical Association.

A note on matrics with given diagonal entries

J. Moon, 1976 .

On an asymptotic method in enumeration

John W. Moon, Amram Meir, J. Moon, 1989, J. Comb. Theory, Ser. A.

On the adjoint of a matrix associated with trees

J. Moon, J. W. Moon, 1995 .

Some enumeration problems for similarity relations

John W. Moon, J. Moon, 1979, Discret. Math..

On Nodes of Given Out-Degree in Random Trees

A. Meir, J. Moon, A. Meir, 1992 .

Strong Tournaments with the Fewest Hamiltonian Paths

J. Moon, L. Yang, 2007 .

On the maximum degree in a random tree.

J. Moon, J. W. Moon, 1968 .

On the Bipartition Numbers of Random Trees, II

John W. Moon, Amram Meir, J. Moon, 1999, Ars Comb..

Tournaments With a Given Automorphism Group

J. Moon, 1964, Canadian Journal of Mathematics.

Packing and covering constants for certain families of trees. I

John W. Moon, Amram Meir, J. Moon, 1977, J. Graph Theory.

On centroid branches of trees from certain families

John W. Moon, Amram Meir, J. Moon, 2002, Discret. Math..

On the centroid of recursive trees

John W. Moon, J. Moon, 2002, Australas. J Comb..

On Major and Minor Branches of Rooted Trees

A. Meir, J. Moon, A. Meir, 1987, Canadian Journal of Mathematics.

On the maximum out-degree in random trees

John W. Moon, Amram Meir, J. Moon, 1990, Australas. J Comb..

Some determinant expansions and the matrix-tree theorem

John W. Moon, J. Moon, 1994, Discret. Math..

On Round-Robin Tournaments with a Unique Maximum Score

J. Moon, Y. Malinovsky, 2022, 2208.14932.

On the negative dependence inequalities and maximal score in round-robin tournament

J. Moon, Y. Malinovsky, 2021 .

Some asymptotic results useful in enumeration problems

A. Meir, J. Moon, A. Meir, 1987 .