Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Robert A. Beezer"'
Autor:
Robert A. Beezer, E. J. Farrell
Publikováno v:
International Journal of Mathematics and Mathematical Sciences, Vol 23, Iss 2, Pp 89-97 (2000)
A distance-regular graph of diameter d has 2d intersection numbers that determine many properties of graph (e.g., its spectrum). We show that the first six coefficients of the matching polynomial of a distance-regular graph can also be determined fro
Externí odkaz:
https://doaj.org/article/c1ff254edc0a4638a2f10b8ffc16202a
Autor:
Alexáander Borbóon Alpízar, null Apu V, Robert A. Beezer, H. Andrew Black, Michael Cantino, Paulo Cereda, David Crossland, Vic van Dijk, Jonathan Fine, Michal Hoftich, Amelia Hugill-Fontanel, Rahul Jaiswal, Emílio Kavamura, Vafa Khalighi, Alexei Kolesnikov, Rahul Krishnan S, Marcel Krüger, Al Maneki, Frank Mittelbach, Ross Moore, Michael Nolan, Todd Pagano, Hugh Paterson, Simon Porter, Thomas Price, Aravind Rajendran, T. Rishi, Matheus Rocha, Volker Sorge, Paulo Ney de Souza, Suhas Chikkanaravangala Vijayakumar, Joseph Wright
Publikováno v:
TUGboat. 42:208-212
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::16e5531d2ed59d64cdb64fa697ac0163
https://doi.org/10.47397/tb/42-2/tb131abstracts
https://doi.org/10.47397/tb/42-2/tb131abstracts
Publikováno v:
ZDM. 50:863-879
This paper adopts a multimodal approach to the latest generation of digital mathematics textbooks (print and online) to investigate how the design, content, and features facilitate the construction of mathematical knowledge for teaching and learning
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0e28b66e293dd3a4dee19b7a011ea517
https://doi.org/10.1007/s11858-018-0959-8
https://doi.org/10.1007/s11858-018-0959-8
Autor:
Robert A. Beezer
Publikováno v:
Balisage Series on Markup Technologies.
PreTeXt is an XML vocabulary for scholarly documents. A key feature is the rigorous separation of presentation and content. This results in conversions to a variety of outputs, including print, PDF, HTML, EPUB, and Jupyter. While still under heavy an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b7b79e326116520492d7bf4175033717
https://doi.org/10.4242/balisagevol21.beezer01
https://doi.org/10.4242/balisagevol21.beezer01
Autor:
Robert A. Beezer
Publikováno v:
Expositiones Mathematicae. 24(2):185-194
A graph is self-complementary if it is isomorphic to its complement. A graph is vertex transitive if for each choice of vertices u and v there is an automorphism that carries the vertex u to v . The number of vertices in a self-complementary vertex-t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3dc7e1bb23e15ccf76577b129028033b
Autor:
Robert A. Beezer
Publikováno v:
Math Horizons. 12:5-9
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c0256c57a2869eba43f34de6d9166999
https://doi.org/10.1080/10724117.2004.12021779
https://doi.org/10.1080/10724117.2004.12021779
Autor:
Robert A. Beezer
Publikováno v:
Journal of Combinatorial Theory, Series A. 96:341-357
Given a t-(v, k, λ) design, form all of the subsets of the set of blocks. Partition this collection of configurations according to isomorphism and consider the cardinalities of the resulting isomorphism classes. Generalizing previous results for reg
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f143ba2fb8820b1daad57c8784210fcf
https://doi.org/10.1006/jcta.2001.3185
https://doi.org/10.1006/jcta.2001.3185
Autor:
E. J. Farrell, Robert A. Beezer
Publikováno v:
Discrete Mathematics. 137:7-18
The matching polynomial of a graph has coefficients that give the number of matchings in the graph. For a regular graph, we show it is possible to recover the order, degree, girth and number of minimal cycles from the matching polynomial. If a graph
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c6ba4e7fb198fd9b6a8ddb4b9ed08a0d
https://doi.org/10.1016/0012-365x(93)e0125-n
https://doi.org/10.1016/0012-365x(93)e0125-n
Autor:
Robert A. Beezer, John Riegsecker
Publikováno v:
International Journal of Computer Mathematics. 51:1-5
Exhaustive catalogs of graphs can be an indispensable tool for computerized investigations in graph-theoretical research. We describe an algorithm for the creation of catalogs of regular graphs. Using this algorithm, all of the regular graphs on thir
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aa5f65468358f32f4ee7e26d5053f043
https://doi.org/10.1080/00207169408804260
https://doi.org/10.1080/00207169408804260
Autor:
Robert A. Beezer
Publikováno v:
Journal of Graph Theory. 14:509-517
The number of distinct eigenvalues of the adjacency matrix of a graph is bounded below by the diameter of the graph plus one. Many graphs that achieve this lower bound exhibit much symmetry, for example, distance-transitive and distance-regular graph
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f9d344ac74c936ec4ede24b36b40c294
https://doi.org/10.1002/jgt.3190140415
https://doi.org/10.1002/jgt.3190140415