B.R. Myers

531 total citations
35 papers, 371 citations indexed

About

B.R. Myers is a scholar working on Computational Theory and Mathematics, Geometry and Topology and Computer Networks and Communications. According to data from OpenAlex, B.R. Myers has authored 35 papers receiving a total of 371 indexed citations (citations by other indexed papers that have themselves been cited), including 12 papers in Computational Theory and Mathematics, 8 papers in Geometry and Topology and 7 papers in Computer Networks and Communications. Recurrent topics in B.R. Myers's work include Graph theory and applications (8 papers), Interconnection Networks and Systems (7 papers) and Advanced Graph Theory Research (7 papers). B.R. Myers is often cited by papers focused on Graph theory and applications (8 papers), Interconnection Networks and Systems (7 papers) and Advanced Graph Theory Research (7 papers). B.R. Myers collaborates with scholars based in United States, Canada and United Kingdom. B.R. Myers's co-authors include G. Martinelli, Newell R. Kitchen, Kenneth A. Sudduth, H. K. Kesavan and Scott T. Drummond and has published in prestigious journals such as Proceedings of the IEEE, SIAM Review and Electronics Letters.

In The Last Decade

B.R. Myers

29 papers receiving 315 citations

Peers

B.R. Myers
Joseph D. Horton Canada
Richard Johnsonbaugh United States
Hariharan Narayanan United States
Yatsuka Nakamura Japan
Eugene A. Klotz Ukraine
W. O. Alltop United States
Thorsten Theobald Germany
Michael J. Mossinghoff United States
Wojciech A. Trybulec
J. W. Wrench Malaysia
Joseph D. Horton Canada
B.R. Myers
Citations per year, relative to B.R. Myers B.R. Myers (= 1×) peers Joseph D. Horton

Countries citing papers authored by B.R. Myers

Since Specialization
Citations

This map shows the geographic impact of B.R. Myers'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 B.R. Myers with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites B.R. Myers more than expected).

Fields of papers citing papers by B.R. Myers

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by B.R. Myers. 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 B.R. Myers. The network helps show where B.R. Myers may publish in the future.

Co-authorship network of co-authors of B.R. Myers

This figure shows the co-authorship network connecting the top 25 collaborators of B.R. Myers. A scholar is included among the top collaborators of B.R. Myers 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 B.R. Myers. B.R. Myers 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.
Sudduth, Kenneth A., Newell R. Kitchen, B.R. Myers, & Scott T. Drummond. (2009). Estimating Depth to Argillic Soil Horizons using Apparent Electrical Conductivity Response Functions. 2 indexed citations
2.
Myers, B.R.. (1982). Graphs, networks, and algorithms. Proceedings of the IEEE. 70(7). 781–782. 186 indexed citations
3.
Myers, B.R.. (1981). Regular separable graphs of minimum order with given diameter. Discrete Mathematics. 33(3). 289–311. 4 indexed citations
4.
Myers, B.R.. (1981). Enumeration of Tours in Hamiltonian Rectangular Lattice Graphs. Mathematics Magazine. 54(1). 19–23. 7 indexed citations
5.
Myers, B.R.. (1981). Enumeration of Tours in Hamiltonian Rectangular Lattice Graphs. Mathematics Magazine. 54(1). 19–19. 3 indexed citations
6.
Myers, B.R.. (1980). The minimum-order three-connected cubic graphs with specified diameters. IEEE Transactions on Circuits and Systems. 27(8). 698–709. 11 indexed citations
7.
Myers, B.R.. (1980). The Klee and Quaife minimum (d, 1, 3)-graphs revisited. IEEE Transactions on Circuits and Systems. 27(3). 214–220. 6 indexed citations
8.
Myers, B.R.. (1975). On Spanning Trees, Weighted Compositions, Fibonacci Numbers, and Resistor Networks. SIAM Review. 17(3). 465–474. 5 indexed citations
9.
Myers, B.R.. (1972). Hamiltonian factorization of the product of a complete graph with itself. Networks. 2(1). 1–9. 6 indexed citations
10.
Myers, B.R., et al.. (1971). A lower bound on the chromatic number of a graph. Networks. 1(3). 273–277. 4 indexed citations
11.
Myers, B.R.. (1971). Number of spanning trees in a wheel. IEEE Transactions on Circuit Theory. 18(2). 280–282. 25 indexed citations
12.
Myers, B.R.. (1967). Number of Trees in a Cascade of 2-Port Networks. IEEE Transactions on Circuit Theory. 14(3). 284–290. 5 indexed citations
13.
Myers, B.R.. (1967). Efficient generation of tree-admittance products in a cascade of 2 port networks. Proceedings of the Institution of Electrical Engineers. 114(11). 1641–1641. 4 indexed citations
14.
Myers, B.R.. (1966). Comment on "Number of Trees in a Chain of Identical Graphs. IEEE Transactions on Circuit Theory. 13(4). 443–443. 1 indexed citations
15.
Myers, B.R.. (1965). Network theory-An introduction to reciprocal and nonreciprocal circuits. Proceedings of the IEEE. 53(6). 667–667. 57 indexed citations
16.
Myers, B.R.. (1963). The Case for Abolishing the Senior Year in American Undergraduate Engineering Education. IEEE Transactions on Education. 6(1). 1–8.
17.
Myers, B.R.. (1961). Two Theorems in Multi-Weighted Sums. Journal of the Society for Industrial and Applied Mathematics. 9(1). 116–126. 1 indexed citations
18.
19.
Kesavan, H. K. & B.R. Myers. (1961). System Theory in a Unified Curriculum. 4(3). 102–110. 1 indexed citations
20.
Myers, B.R.. (1959). Contributions to Transistor - Rc Network Synthesis. 3 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 Joseph D. Horton Breakdown of academic impact, for papers by Richard Johnsonbaugh Breakdown of academic impact, for papers by Hariharan Narayanan Breakdown of academic impact, for papers by Yatsuka Nakamura Breakdown of academic impact, for papers by Eugene A. Klotz Breakdown of academic impact, for papers by W. O. Alltop Breakdown of academic impact, for papers by Thorsten Theobald Breakdown of academic impact, for papers by Michael J. Mossinghoff Breakdown of academic impact, for papers by Wojciech A. Trybulec Breakdown of academic impact, for papers by J. W. Wrench
Rankless by CCL
2026