Amram Meir

According to our database1, Amram Meir authored at least 23 papers between 1972 and 2006.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of one.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2006
On some applications of graph theory, I.
Discrete Mathematics, 2006

2002
On centroid branches of trees from certain families.
Discrete Mathematics, 2002

2001
Series and Integral Trial Conditions: 10642.
The American Mathematical Monthly, 2001

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

On the Steiner distance of trees from certain families.
Australasian J. Combinatorics, 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

1995
On path entropy functions for rooted trees.
Discrete Mathematics, 1995

1994
On the Wiener index of trees from certain families.
Australasian J. Combinatorics, 1994

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

On the maximum out-degree in random trees.
Australasian J. Combinatorics, 1990

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

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

Survival under random coverings of trees.
Graphs and Combinatorics, 1988

1984
On random mapping patterns.
Combinatorica, 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.
Discrete Mathematics, 1983

1980
Acknowledgment of Priority: On the Order of Random Channel Networks.
SIAM J. Matrix Analysis Applications, 1980

On the Order of Random Channel Networks.
SIAM J. Matrix Analysis Applications, 1980

1978
On total covering and matching of graphs.
J. Comb. Theory, Ser. B, 1978

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

On total matching numbers and total covering numbers of complementary graphs.
Discrete Mathematics, 1977

1972
On some applications of graph theory, I.
Discrete Mathematics, 1972


  Loading...