|
Dragan Marušič
Dragan Marušič (born 1953, Koper, Slovenia) 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. Marušič has published extensively, and has supervised seven PhD students (as of 2013). He served as the third rector of the University of Primorska from 2011-2019, a university he lobbied to have established in his home town of Koper. His research focuses on topics in algebraic graph theory, particularly the symmetry of graphs and the action of finite groups on combinatorial objects. He is regarded as the founder of the Slovenian school of research in algebraic graph theory and permutation groups. Education and career From 1968 to 1972 Marušič attended gymnasium in Koper. He studied undergraduate mathematics at the University of Ljubljana, graduating in 1976. He completed his PhD in 1981 in England, at the Unive ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Koper, Slovenia
Koper (; it, Capodistria, hr, Kopar) is the fifth largest city in Slovenia. Located in the Istrian region in the southwestern part of the country, approximately five kilometres () south of the border with Italy and 20 kilometres () from Trieste, Koper is the largest coastal city in the country. It is bordered by the satellite towns of Izola and Ankaran. With a unique ecology and biodiversity, it is considered an important natural resource. The city's Port of Koper is Slovenia's only container port and a major contributor to the economy of the Municipality of Koper. The influence of the Port of Koper on tourism was one of the factors in Ankaran deciding to leave the municipality in a referendum in 2011 to establish its own municipality. The city is a destination for a number of Mediterranean cruising lines. Koper is the main urban centre of the Slovenian Istria, with a population of about 25,000. Aleš Bržan is the current mayor, serving since 2018. The city of Koper is offic ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Gymnasium (school)
''Gymnasium'' (and variations of the word) is a term in various European languages for a secondary school that prepares students for higher education at a university. It is comparable to the US English term '' preparatory high school''. Before the 20th century, the gymnasium system was a widespread feature of educational systems throughout many European countries. The word (), from Greek () 'naked' or 'nude', was first used in Ancient Greece, in the sense of a place for both physical and intellectual education of young men. The latter meaning of a place of intellectual education persisted in many European languages (including Albanian, Bulgarian, Estonian, Greek, German, Hungarian, the Scandinavian languages, Dutch, Polish, Czech, Serbo-Croatian, Macedonian, Slovak, Slovenian and Russian), whereas in other languages, like English (''gymnasium'', ''gym'') and Spanish (''gimnasio''), the former meaning of a place for physical education was retained. School structure Be ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Dorijan Marušič
Dorijan Marušič (born 13 June 1957) is a Slovenian doctor and politician, State Secretary at the Ministry of Health of Slovenia since 2000 and Minister of Health of Slovenia since 2010. Education Dorijan Marušič was born in Koper. After graduating from Koper Gumnasium, he attended the University of Ljubljana, Faculty of Natural Sciences and Engineering (1976-1981) graduating in mathematics. Afterwards he attended the Faculty of Medicine in Ljubljana, graduating in 1989. He specialised internal medicine and then worked at Izola General Hospital, the University Clinic in Groningen and the Ljubljana University Medical Centre, until 1995. In 2003, he enrolled in post-graduate studies in management of non-profit organisations at the Faculty of Social Sciences, University of Ljubljana.Mini ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Gray Graph
Grey (more common in British English) or gray (more common in American English) is an intermediate color between black and white. It is a neutral or achromatic color, meaning literally that it is "without color", because it can be composed of black and white. It is the color of a cloud-covered sky, of ash and of lead. The first recorded use of ''grey'' as a color name in the English language was in 700 CE.Maerz and Paul ''A Dictionary of Color'' New York:1930 McGraw-Hill Page 196 ''Grey'' is the dominant spelling in European and Commonwealth English, while ''gray'' has been the preferred spelling in American English; both spellings are valid in both varieties of English. In Europe and North America, surveys show that grey is the color most commonly associated with neutrality, conformity, boredom, uncertainty, old age, indifference, and modesty. Only one percent of respondents chose it as their favorite color. Etymology ''Grey'' comes from the Middle English or , ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Half-transitive Graph
In the mathematical field of graph theory, a half-transitive graph is a graph that is both vertex-transitive and edge-transitive, but not symmetric. In other words, a graph is half-transitive if its automorphism group acts transitively upon both its vertices and its edges, but not on ordered pairs of linked vertices. Every connected symmetric graph must be vertex-transitive and edge-transitive, and the converse is true for graphs of odd degree, so that half-transitive graphs of odd degree do not exist. However, there do exist half-transitive graphs of even degree. The smallest half-transitive graph is the Holt graph In graph theory, the Holt graph or Doyle graph is the smallest half-transitive graph, that is, the smallest example of a vertex-transitive and edge-transitive graph which is not also symmetric. Such graphs are not common. It is named after Peter ..., with degree 4 and 27 vertices.. References {{reflist Graph families Algebraic graph theory Regular graphs [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Semi-symmetric Graph
In the mathematical field of graph theory, a semi-symmetric graph is an undirected graph that is edge-transitive and regular, but not vertex-transitive. In other words, a graph is semi-symmetric if each vertex has the same number of incident edges, and there is a symmetry taking any of the graph's edges to any other of its edges, but there is some pair of vertices such that no symmetry maps the first into the second. Properties A semi-symmetric graph must be bipartite, and its automorphism group must act transitively on each of the two vertex sets of the bipartition (in fact, regularity is not required for this property to hold). For instance, in the diagram of the Folkman graph shown here, green vertices can not be mapped to red ones by any automorphism, but every two vertices of the same color are symmetric with each other. History Semi-symmetric graphs were first studied E. Dauber, a student of F. Harary, in a paper, no longer available, titled "On line- but not point-sym ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hamiltonian Path
In the mathematical field of graph theory, a Hamiltonian path (or traceable path) is a path in an undirected or directed graph that visits each vertex exactly once. A Hamiltonian cycle (or Hamiltonian circuit) is a cycle that visits each vertex exactly once. A Hamiltonian path that starts and ends at adjacent vertices can be completed by adding one more edge to form a Hamiltonian cycle, and removing any edge from a Hamiltonian cycle produces a Hamiltonian path. Determining whether such paths and cycles exist in graphs (the Hamiltonian path problem and Hamiltonian cycle problem) are NP-complete. Hamiltonian paths and cycles are named after William Rowan Hamilton who invented the icosian game, now also known as ''Hamilton's puzzle'', which involves finding a Hamiltonian cycle in the edge graph of the dodecahedron. Hamilton solved this problem using the icosian calculus, an algebraic structure based on roots of unity with many similarities to the quaternions (also invented by Hami ... [...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] |
Group Action (mathematics)
In mathematics, a group action on a space is a group homomorphism of a given group into the group of transformations of the space. Similarly, a group action on a mathematical structure is a group homomorphism of a group into the automorphism group of the structure. It is said that the group ''acts'' on the space or structure. If a group acts on a structure, it will usually also act on objects built from that structure. For example, the group of Euclidean isometries acts on Euclidean space and also on the figures drawn in it. For example, it acts on the set of all triangles. Similarly, the group of symmetries of a polyhedron acts on the vertices, the edges, and the faces of the polyhedron. A group action on a vector space is called a representation of the group. In the case of a finite-dimensional vector space, it allows one to identify many groups with subgroups of , the group of the invertible matrices of dimension over a field . The symmetric group acts on any set wit ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Sigmund Zois
Sigmund Zois Freiherr von Edelstein, usually referred as Sigmund Zois ( sl, Žiga Zois, formerly Slovenized as ''Cojs'' or ''Cojz''; ) (23 November 1747 – 10 November 1819) was a Carniolan nobleman, natural scientist and patron of the arts. He is considered one of the most influential figures of the Enlightenment Era in the Slovene Lands of Habsburg Austria. Family Sigmund's father Michelangelo Zois (1694–1777) was a merchant from Lombardy that moved to Ljubljana, where he made a considerable fortune in dealing with iron and holding mines. His second marriage was to a Carniolan noblewoman from the family Kappus (also Kapus) von Pichelstein; he was ennobled in 1739 and acquired the right to the title of baron in 1760. He owned large estates both in Carniola and on the Karst Plateau, and Sigmund was born in Trieste, in one of his father's mansions. The Carniolan noble family Kappus von Pichelstein on Zois's mother's side was a prosperous family that had lived at Kamna Gorica ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ars Mathematica Contemporanea
''Ars Mathematica Contemporanea'' is a quarterly peer-reviewed scientific journal covering discrete mathematics in connection with other branches of mathematics. It is published by the University of Primorska together with the Society of Mathematicians, Physicists and Astronomers of Slovenia, the Institute of Mathematics, Physics, and Mechanics, and the Slovenian Discrete and Applied Mathematics Society. It is a platinum open access journal, with articles published under the Creative Commons Attribution 4.0 license. Abstracting and indexing The journal is indexed by: *Current Contents/Physical, Chemical & Earth Sciences *Mathematical Reviews *Science Citation Index Expanded *Scopus *zbMATH According to the ''Journal Citation Reports'', the journal has a 2018 impact factor of 0.910. See also * List of academic journals published in Slovenia This is a list of notable academic journals published in Slovenia. {{Compact ToC A * '' Acta Chimica Slovenica'' * ''Acta Geographica Slov ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Tomaž Pisanski
Tomaž (Tomo) Pisanski (born 24 May 1949 in Ljubljana, Yugoslavia, which is now in Slovenia) 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." Biography As a high school student, Pisanski competed in the 1966 and 1967 International Mathematical Olympiads as a member of the Yugoslav team, winning a bronze medal in 1967. He studied at the University of Ljubljana where he obtained a B.Sc, M.Sc and PhD in mathematics. His 1981 PhD thesis in topological graph theory was written under the guidance of Torrence Parsons. He also obtained an M.Sc. in computer science from Pennsylvania State University in 1979. Currently, Pisanski is a professor of discrete and computational mathematics and Head of the Department of Information Sciences and Technology at University of Primorska in Koper. In addition, he is a professor at the University of Ljubljana Fac ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
.JPG "Click for more on -> Gymnasium (school)")
