John W. Moon

According to our database1, John W. Moon authored at least 37 papers between 1968 and 2004.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2004
Weakening arcs in tournaments.
J. Graph Theory, 2004

2002
On centroid branches of trees from certain families.
Discret. Math., 2002

On the centroid of recursive trees.
Australas. J Comb., 2002

2001
Leaves of Ordered Trees: 10753.
Am. Math. Mon., 2001

2000
A Bijective Proof of an Identity Concerning Nodes of Fixed Degree in Planted Trees.
Ars Comb., 2000

1999
On the Bipartition Numbers of Random Trees, II.
Ars Comb., 1999

On the General Randic Index for Certain Families of Trees.
Ars Comb., 1999

On the Steiner distance of trees from certain families.
Australas. J Comb., 1999

1998
Addendum to On the log-product of the subtree-sizes of random trees.
Random Struct. Algorithms, 1998

On the log-product of the subtree-sizes of random trees.
Random Struct. Algorithms, 1998

1997
On the number of induced subgraphs of trees.
Discret. Math., 1997

1996
On the total distance between nodes in tournaments.
Discret. Math., 1996

1995
The number of 4-cycles in triangle-free oriented graphs.
Discret. Math., 1995

On path entropy functions for rooted trees.
Discret. Math., 1995

1994
Some determinant expansions and the matrix-tree theorem.
Discret. Math., 1994

On the Wiener index of trees from certain families.
Australas. J Comb., 1994

1993
Uncovered nodes and 3-cycles in tournaments.
Australas. J Comb., 1993

1990
The Asymptotic Behaviour of Coefficients of Powers of Certain Generating Functions.
Eur. J. Comb., 1990

On the maximum out-degree in random trees.
Australas. J Comb., 1990

1989
On an asymptotic method in enumeration.
J. Comb. Theory, Ser. A, 1989

1988
On maximal independent sets of nodes in trees.
J. Graph Theory, 1988

Amalgamation of team tournaments.
J. Comb. Theory, Ser. B, 1988

Survival under random coverings of trees.
Graphs Comb., 1988

1987
The number of trees with a 1-factor.
Discret. Math., 1987

1984
On random mapping patterns.
Comb., 1984

1983
Hereditarily finite sets and identity trees.
J. Comb. Theory, Ser. B, 1983

On an asymptotic evaluation of the cycle index of the symmetric group.
Discret. Math., 1983

1982
The number of tournaments with a unique spanning cycle.
J. Graph Theory, 1982

1980
Acknowledgment of Priority: On the Order of Random Channel Networks.
SIAM J. Algebraic Discret. Methods, 1980

On the Order of Random Channel Networks.
SIAM J. Algebraic Discret. Methods, 1980

Lattice Paths in Regions with the Catalan Property.
J. Comb. Theory, Ser. A, 1980

1979
Some enumeration problems for similarity relations.
Discret. Math., 1979

1977
Packing and covering constants for certain families of trees. I.
J. Graph Theory, 1977

Enumerating a class of nested group testing procedures.
J. Comb. Theory, Ser. B, 1977

1976
A problem on arcs without bypasses in tournaments.
J. Comb. Theory, Ser. B, 1976

1972
Embedding tournaments in simple tournaments.
Discret. Math., 1972

1968
Tournaments and handicaps.
Proceedings of the Information Processing, Proceedings of IFIP Congress 1968, Edinburgh, UK, 5-10 August 1968, Volume 1, 1968


  Loading...