Tomaž(Tomo) Pisanski is a Slovenian mathematician working mainly in discrete mathematics and graph theory. He is considered by many Slovenian mathematicians to be the "father of Slovenian discrete mathematics."
Dragan Marušič is a Slovene mathematician. Marušičobtained his BSc in technical mathematics from the University of Ljubljana in 1976,and his PhD from the University of Reading in 1981 under the supervision of Crispin Nash-Williams.
In the mathematical field of graph theory,the Heawood graph is an undirected graph with 14 vertices and 21 edges,named after Percy John Heawood.
University of Primorska is a public university in Slovenia. It is located in Koper,Izola,and Portorožand is named for the Slovenian Littoral region,where it is located.
In the mathematical field of graph theory,a toroidal graph is a graph that can be embedded on a torus. In other words,the graph's vertices and edges can be placed on a torus such that no edges intersect except at a vertex that belongs to both.
Cheryl Elisabeth Praeger is an Australian mathematician. Praeger received BSc (1969) and MSc degrees from the University of Queensland (1974),and a doctorate from the University of Oxford in 1973 under direction of Peter M. Neumann. She has published widely and has advised 27 PhD students. She is currently Emeritus Professor of Mathematics at the University of Western Australia. She is best known for her works in group theory,algebraic graph theory and combinatorial designs.
In the mathematical field of graph theory,the Möbius–Kantor graph is a symmetric bipartite cubic graph with 16 vertices and 24 edges named after August Ferdinand Möbius and Seligmann Kantor. It can be defined as the generalized Petersen graph G(8,3):that is,it is formed by the vertices of an octagon,connected to the vertices of an eight-point star in which each point of the star is connected to the points three steps away from it.
In graph theory,a branch of mathematics,a Hamiltonian decomposition of a given graph is a partition of the edges of the graph into Hamiltonian cycles. Hamiltonian decompositions have been studied both for undirected graphs and for directed graphs. In the undirected case a Hamiltonian decomposition can also be described as a 2-factorization of the graph such that each factor is connected.
In the mathematical field of graph theory,the Nauru graph is a symmetric,bipartite,cubic graph with 24 vertices and 36 edges. It was named by David Eppstein after the twelve-pointed star in the flag of Nauru.
Italo Jose Dejter is an Argentine-born American mathematician,a retired professor of mathematics and computer science from the University of Puerto Rico,and a researcher in algebraic topology,differential topology,graph theory,coding theory and combinatorial designs. He obtained a Licentiate degree in mathematics from University of Buenos Aires in 1967,arrived at Rutgers University in 1970 by means of a Guggenheim Fellowship and obtained a Ph.D. degree in mathematics in 1975 under the supervision of Professor Ted Petrie,with support of the National Science Foundation. He was a professor at the Federal University of Santa Catarina,Brazil,from 1977 to 1984,with grants from the National Council for Scientific and Technological Development,(CNPq).
Brian Roger Alspach is a mathematician whose main research interest is in graph theory. Alspach has also studied the mathematics behind poker,and writes for Poker Digestand Canadian Poker Player magazines.
In graph theory,a branch of mathematics,the Erdős–Hajnal conjecture states that families of graphs defined by forbidden induced subgraphs have either large cliques or large independent sets. It is named for Paul Erdős and András Hajnal.
In the mathematical field of graph theory,a prism graph is a graph that has one of the prisms as its skeleton.
Isabel Alicia Hubard Escalerais a Mexican mathematician in the Institute of Mathematics of the National Autonomous University of Mexico (UNAM).
Andreas Brandstädt is a German mathematician and computer scientist.
Pinar Heggernes is a Turkish-born Norwegian computer scientist known for her research on graph algorithms,sparse matrix computations,and parameterized complexity. She is the deputy rector of the University of Bergen,elected together with rector Margareth Hagen for the period 2021–2025. Until August 2021,she was the head of the Department of Informatics at the University of Bergen. She is also a member of the board of directors of the Research Council of Norway,appointed for the period 2019–2022.
In the mathematical field of graph theory,a word-representable graph is a graph that can be characterized by a word whose entries alternate in a prescribed way. In particular,if the vertex set of the graph is V,one should be able to choose a word w over the alphabet V such that letters a and b alternate in w if and only if the pair ab is an edge in the graph. For example,the cycle graph labeled by a,b,c and d in clock-wise direction is word-representable because it can be represented by abdacdbc:the pairs ab,bc,cd and ad alternate,but the pairs ac and bd do not.
Joy Morris is a Canadian mathematician whose research involves group theory,graph theory,and the connections between the two through Cayley graphs. She is also interested in mathematics education,is the author of two open-access undergraduate mathematics textbooks,and oversees a program in which university mathematics education students provide a drop-in mathematics tutoring service for parents of middle school students. She is a professor of mathematics at the University of Lethbridge.
Mirka Miller was a Czech-Australian mathematician and computer scientist interested in graph theory and data security. She was a professor of electrical engineering and computer science at the University of Newcastle.
In graph theory,the McKay–Miller–Širáňgraphs are an infinite class of vertex-transitive graphs with diameter two,and with a large number of vertices relative to their diameter and degree. They are named after Brendan McKay,Mirka Miller,and Jozef Širáň,who first constructed them using voltage graphs in 1998.
