|
Mirka Miller
Mirka Miller (née Koutova, 9 May 1949 – 2 January 2016) 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. Life Miller was born on 9 May 1949 in Rumburk, then part of Czechoslovakia, as the oldest in a family of five children. After attempting to escape Czechoslovakia in 1968, stopped because of her companion's illness, she became a student at Charles University before successfully escaping in 1969 and becoming a refugee in Australia. Miller earned a bachelor's degree from the University of Sydney in 1976, both in mathematics and computer science, and as a student also played volleyball for the New South Wales team and then the Australia women's national volleyball team. She married ornithologist Ben Miller, became a computer programmer working with the Sydney Morning Herald and for NSW Parks and Wildlife on Lord Howe Island, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Graph Theory
In mathematics, graph theory is the study of ''graphs'', which are mathematical structures used to model pairwise relations between objects. A graph in this context is made up of '' vertices'' (also called ''nodes'' or ''points'') which are connected by '' edges'' (also called ''links'' or ''lines''). A distinction is made between undirected graphs, where edges link two vertices symmetrically, and directed graphs, where edges link two vertices asymmetrically. Graphs are one of the principal objects of study in discrete mathematics. Definitions Definitions in graph theory vary. The following are some of the more basic ways of defining graphs and related mathematical structures. Graph In one restricted but very common sense of the term, a graph is an ordered pair G=(V,E) comprising: * V, a set of vertices (also called nodes or points); * E \subseteq \, a set of edges (also called links or lines), which are unordered pairs of vertices (that is, an edge is associated with t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
European Journal Of Combinatorics
European, or Europeans, or Europeneans, may refer to: In general * ''European'', an adjective referring to something of, from, or related to Europe ** Ethnic groups in Europe ** Demographics of Europe ** European cuisine, the cuisines of Europe and other Western countries * ''European'', an adjective referring to something of, from, or related to the European Union ** Citizenship of the European Union ** Demographics of the European Union In publishing * ''The European'' (1953 magazine), a far-right cultural and political magazine published 1953–1959 * ''The European'' (newspaper), a British weekly newspaper published 1990–1998 * ''The European'' (2009 magazine), a German magazine first published in September 2009 *''The European Magazine'', a magazine published in London 1782–1826 *''The New European'', a British weekly pop-up newspaper first published in July 2016 Other uses * * Europeans (band), a British post-punk group, from Bristol See also * * * Europe (disam ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Australian Women Computer Scientists
Australian(s) may refer to: Australia * Australia, a country * Australians, citizens of the Commonwealth of Australia ** European Australians ** Anglo-Celtic Australians, Australians descended principally from British colonists ** Aboriginal Australians, indigenous peoples of Australia as identified and defined within Australian law * Australia (continent) ** Indigenous Australians * Australian English, the dialect of the English language spoken in Australia * Australian Aboriginal languages * ''The Australian ''The Australian'', with its Saturday edition, ''The Weekend Australian'', is a broadsheet newspaper published by News Corp Australia since 14 July 1964.Bruns, Axel. "3.1. The active audience: Transforming journalism from gatekeeping to gatew ...'', a newspaper * Australiana, things of Australian origins Other uses * Australian (horse), a racehorse * Australian, British Columbia, an unincorporated community in Canada See also * The Australian (disambiguation ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
2016 Deaths
This is a list of deaths of notable people, organised by year. New deaths articles are added to their respective month (e.g., Deaths in ) and then linked here. 2022 2021 2020 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996 1995 1994 1993 1992 1991 1990 1989 1988 1987 See also * Lists of deaths by day The following pages, corresponding to the Gregorian calendar, list the historical events, births, deaths, and holidays and observances of the specified day of the year: Footnotes See also * Leap year * List of calendars * List of non-standard ... * Deaths by year {{DEFAULTSORT:deaths by year ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
1949 Births
Events January * January 1 – A United Nations-sponsored ceasefire brings an end to the Indo-Pakistani War of 1947. The war results in a stalemate and the division of Kashmir, which still continues as of 2022. * January 2 – Luis Muñoz Marín becomes the first democratically elected Governor of Puerto Rico. * January 11 – The first "networked" television broadcasts take place, as KDKA-TV in Pittsburgh, Pennsylvania goes on the air, connecting east coast and mid-west programming in the United States. * January 16 – Şemsettin Günaltay forms the new government of Turkey. It is the 18th government, last One-party state, single party government of the Republican People's Party. * January 17 – The first Volkswagen Beetle, VW Type 1 to arrive in the United States, a 1948 model, is brought to New York City, New York by Dutch businessman Ben Pon Sr., Ben Pon. Unable to interest dealers or importers in the Volkswagen, Pon sells the sample car to pay his ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematical Association Of America
The Mathematical Association of America (MAA) is a professional society that focuses on mathematics accessible at the undergraduate level. Members include university, college, and high school teachers; graduate and undergraduate students; pure and applied mathematicians; computer scientists; statisticians; and many others in academia, government, business, and industry. The MAA was founded in 1915 and is headquartered at 1529 18th Street, Northwest in the Dupont Circle neighborhood of Washington, D.C. The organization publishes mathematics journals and books, including the '' American Mathematical Monthly'' (established in 1894 by Benjamin Finkel), the most widely read mathematics journal in the world according to records on JSTOR. Mission and Vision The mission of the MAA is to advance the understanding of mathematics and its impact on our world. We envision a society that values the power and beauty of mathematics and fully realizes its potential to promote human flourishing ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
ZbMATH
zbMATH Open, formerly Zentralblatt MATH, is a major reviewing service providing reviews and abstracts for articles in pure mathematics, pure and applied mathematics, produced by the Berlin office of FIZ Karlsruhe – Leibniz Institute for Information Infrastructure GmbH. Editors are the European Mathematical Society, FIZ Karlsruhe, and the Heidelberg Academy of Sciences. zbMATH is distributed by Springer Science+Business Media. It uses the Mathematics Subject Classification codes for organising reviews by topic. History Mathematicians Richard Courant, Otto Neugebauer, and Harald Bohr, together with the publisher Ferdinand Springer, took the initiative for a new mathematical reviewing journal. Harald Bohr worked in Copenhagen. Courant and Neugebauer were professors at the University of Göttingen. At that time, Göttingen was considered one of the central places for mathematical research, having appointed mathematicians like David Hilbert, Hermann Minkowski, Carl Runge, and Felix ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hoffman–Singleton Graph
In the mathematical field of graph theory, the Hoffman–Singleton graph is a 7- regular undirected graph with 50 vertices and 175 edges. It is the unique strongly regular graph with parameters (50,7,0,1). It was constructed by Alan Hoffman and Robert Singleton while trying to classify all Moore graphs, and is the highest-order Moore graph known to exist. Since it is a Moore graph where each vertex has degree 7, and the girth is 5, it is a (7,5)-cage. Construction Here are two constructions of the Hoffman–Singleton graph. Construction from pentagons and pentagrams Take five pentagons ''Ph'' and five pentagrams ''Qi'' . Join vertex ''j'' of ''Ph'' to vertex ''h''·''i''+''j'' of ''Qi''. (All indices are modulo 5.) Construction from PG(3,2) Take a Fano plane on seven elements, such as and apply all 2520 even permutations on the 7-set ''abcdefg''. Canonicalize each such Fano plane (e.g. by reducing to lexicographic order) and discard duplicates. Exactly 15 Fano planes remai ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Brendan McKay (mathematician)
Brendan Damien McKay (born 26 October 1951 in Melbourne, Australia) is an Emeritus Professor in the Research School of Computer Science at the Australian National University (ANU). He has published extensively in combinatorics. McKay received a Ph.D. in mathematics from the University of Melbourne in 1980, and was appointed Assistant Professor of Computer Science at Vanderbilt University, Nashville in the same year (1980–1983). His thesis, ''Topics in Computational Graph Theory'', was written under the direction of Derek Holton. He was awarded the Australian Mathematical Society Medal in 1990. He was elected a Fellow of the Australian Academy of Science in 1997, and appointed Professor of Computer Science at the ANU in 2000. Mathematics McKay is the author of at least 127 refereed articles. One of McKay's main contributions has been a practical algorithm for the graph isomorphism problem and its software implementation NAUTY (No AUTomorphisms, Yes?). Further achievements inc ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
McKay–Miller–Širáň Graph
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. Background The context for the construction of these graphs is the degree diameter problem in graph theory, which seeks the largest possible graph for each combination of degree and diameter. For graphs of diameter two, every vertex can be reached in two steps from an arbitrary starting vertex, and if the degree is d then at most d vertices can be reached in one step and another d(d-1) in two steps, giving the Moore bound that the total number of vertices can be at most d^2+1. However, only four graphs are known to reach this bound: a single edge (degree one), a 5-vertex cycle graph (degree two), the Petersen graph (degree three), and the Hoffman–Singleton grap ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Vertex (graph Theory)
In discrete mathematics, and more specifically in graph theory, a vertex (plural vertices) or node is the fundamental unit of which graphs are formed: an undirected graph consists of a set of vertices and a set of edges (unordered pairs of vertices), while a directed graph consists of a set of vertices and a set of arcs (ordered pairs of vertices). In a diagram of a graph, a vertex is usually represented by a circle with a label, and an edge is represented by a line or arrow extending from one vertex to another. From the point of view of graph theory, vertices are treated as featureless and indivisible objects, although they may have additional structure depending on the application from which the graph arises; for instance, a semantic network is a graph in which the vertices represent concepts or classes of objects. The two vertices forming an edge are said to be the endpoints of this edge, and the edge is said to be incident to the vertices. A vertex ''w'' is said to be ad ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Vertex-transitive Graph
In the mathematical field of graph theory, a vertex-transitive graph is a graph in which, given any two vertices and of , there is some automorphism :f : G \to G\ such that :f(v_1) = v_2.\ In other words, a graph is vertex-transitive if its automorphism group acts transitively on its vertices.. A graph is vertex-transitive if and only if its graph complement is, since the group actions are identical. Every symmetric graph without isolated vertices is vertex-transitive, and every vertex-transitive graph is regular. However, not all vertex-transitive graphs are symmetric (for example, the edges of the truncated tetrahedron), and not all regular graphs are vertex-transitive (for example, the Frucht graph and Tietze's graph). Finite examples Finite vertex-transitive graphs include the symmetric graphs (such as the Petersen graph, the Heawood graph and the vertices and edges of the Platonic solids). The finite Cayley graphs (such as cube-connected cycles) are also ve ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
