Dale M. Mesner

793 total citations
21 papers, 474 citations indexed

About

Dale M. Mesner is a scholar working on Electrical and Electronic Engineering, Discrete Mathematics and Combinatorics and Artificial Intelligence. According to data from OpenAlex, Dale M. Mesner has authored 21 papers receiving a total of 474 indexed citations (citations by other indexed papers that have themselves been cited), including 15 papers in Electrical and Electronic Engineering, 11 papers in Discrete Mathematics and Combinatorics and 5 papers in Artificial Intelligence. Recurrent topics in Dale M. Mesner's work include graph theory and CDMA systems (15 papers), Finite Group Theory Research (10 papers) and Coding theory and cryptography (5 papers). Dale M. Mesner is often cited by papers focused on graph theory and CDMA systems (15 papers), Finite Group Theory Research (10 papers) and Coding theory and cryptography (5 papers). Dale M. Mesner collaborates with scholars based in United States, Slovakia and Canada. Dale M. Mesner's co-authors include Earl S. Kramer, R. C. Bose, Mark E. Watkins, A.E. Brouwer, Prabir Bhattacharya, Spyros S. Magliveras, Paritosh Bhattacharya, Marley W. Watkins, Tran van Trung and Geňa Hahn and has published in prestigious journals such as Indiana University Mathematics Journal, Journal of Algebra and Discrete Mathematics.

In The Last Decade

Dale M. Mesner

20 papers receiving 391 citations

Peers

Dale M. Mesner
E. T. Parker United States
David A. Drake United States
Albrecht Beutelspacher Germany
Jennifer Seberry Australia
R.P. Anstee Canada
M. J. Grannell United Kingdom
Philippe Delsarte Belgium
Sándor Szabó Hungary
J Bermond France
Geňa Hahn Canada
E. T. Parker United States
Dale M. Mesner
Citations per year, relative to Dale M. Mesner Dale M. Mesner (= 1×) peers E. T. Parker

Countries citing papers authored by Dale M. Mesner

Since Specialization
Citations

This map shows the geographic impact of Dale M. Mesner's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Dale M. Mesner with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Dale M. Mesner more than expected).

Fields of papers citing papers by Dale M. Mesner

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Dale M. Mesner. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Dale M. Mesner. The network helps show where Dale M. Mesner may publish in the future.

Co-authorship network of co-authors of Dale M. Mesner

This figure shows the co-authorship network connecting the top 25 collaborators of Dale M. Mesner. A scholar is included among the top collaborators of Dale M. Mesner based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Dale M. Mesner. Dale M. Mesner is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Klin, Mikhail, Dale M. Mesner, & Andrew J. Woldar. (2010). A combinatorial approach to transitive extensions of generously unitransitive permutation groups. Journal of Combinatorial Designs. 18(5). 369–391. 1 indexed citations
2.
Jajcay, Robert & Dale M. Mesner. (2000). Embedding arbitrary finite simple graphs into small strongly regular graphs. Journal of Graph Theory. 34(1). 1–8.
3.
Trung, Tran van, et al.. (1996). High order intersection numbers of t-designs. Journal of Statistical Planning and Inference. 56(2). 257–268. 8 indexed citations
4.
Brualdi, Richard A., et al.. (1995). On a matrix partition conjecture. Journal of Combinatorial Theory Series A. 69(2). 333–346. 1 indexed citations
5.
Mesner, Dale M. & Paritosh Bhattacharya. (1994). A Ternary Algebra Arising from Association Schemes on Triples. Journal of Algebra. 164(3). 595–613. 9 indexed citations
6.
Mesner, Dale M. & Prabir Bhattacharya. (1990). Association schemes on triples and a ternary algebra. Journal of Combinatorial Theory Series A. 55(2). 204–234. 14 indexed citations
7.
Brouwer, A.E. & Dale M. Mesner. (1985). The Connectivity of Strongly Regular Graphs. European Journal of Combinatorics. 6(3). 215–216. 27 indexed citations
8.
Kramer, Earl S., Spyros S. Magliveras, & Dale M. Mesner. (1981). t-Designs from the large Mathieu groups. Discrete Mathematics. 36(2). 171–189. 8 indexed citations
9.
Kramer, Earl S., Spyros S. Magliveras, & Dale M. Mesner. (1981). t-Designs from the large Mathieu groups. Discrete Mathematics. 36(3). 171–189. 5 indexed citations
10.
Kramer, Earl S., Spyros S. Magliveras, & Dale M. Mesner. (1980). Some resolutions of S(5, 8, 24). Journal of Combinatorial Theory Series A. 29(2). 166–173. 3 indexed citations
11.
Kramer, Earl S. & Dale M. Mesner. (1976). t-designs on hypergraphs. Discrete Mathematics. 15(3). 263–296. 94 indexed citations
12.
Kramer, Earl S. & Dale M. Mesner. (1974). On Steiner tableaus. Discrete Mathematics. 10(1). 123–131. 1 indexed citations
13.
Kramer, Earl S. & Dale M. Mesner. (1974). Intersections among Steiner systems. Journal of Combinatorial Theory Series A. 16(3). 273–285. 47 indexed citations
14.
Mesner, Dale M.. (1967). Sets of Disjoint Lines in PG(3, q). Canadian Journal of Mathematics. 19. 273–280. 23 indexed citations
15.
Mesner, Dale M.. (1967). A New Family of Partially Balanced Incomplete Block Designs with Some Latin Square Design Properties. The Annals of Mathematical Statistics. 38(2). 571–581. 22 indexed citations
16.
Watkins, Mark E. & Dale M. Mesner. (1967). Cycles and Connectivity in Graphs. Canadian Journal of Mathematics. 19. 1319–1328. 53 indexed citations
17.
Mesner, Dale M. & Marley W. Watkins. (1966). Some Theorems about N-Vertex Connected Graphs. Indiana University Mathematics Journal. 16(4). 321–326. 6 indexed citations
18.
Mesner, Dale M.. (1965). A Note on the Parameters of PBIB Association Schemes. The Annals of Mathematical Statistics. 36(1). 331–336. 5 indexed citations
19.
Mesner, Dale M.. (1964). Negative latin square designs. NCSU Libraries Repository (North Carolina State University Libraries). 7 indexed citations
20.
Bose, R. C. & Dale M. Mesner. (1959). On Linear Associative Algebras Corresponding to Association Schemes of Partially Balanced Designs. The Annals of Mathematical Statistics. 30(1). 21–38. 139 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by E. T. Parker Breakdown of academic impact, for papers by David A. Drake Breakdown of academic impact, for papers by Albrecht Beutelspacher Breakdown of academic impact, for papers by Jennifer Seberry Breakdown of academic impact, for papers by R.P. Anstee Breakdown of academic impact, for papers by M. J. Grannell Breakdown of academic impact, for papers by Philippe Delsarte Breakdown of academic impact, for papers by Sándor Szabó Breakdown of academic impact, for papers by J Bermond Breakdown of academic impact, for papers by Geňa Hahn
Rankless by CCL
2026