WikiMili The Free Encyclopedia

**Thomas William Tucker** (born July 15, 1945) is an American mathematician, the Charles Hetherington Professor of Mathematics at Colgate University,^{ [1] } and an expert in the area of topological graph theory.^{ [2] }^{ [3] }

**Colgate University** is a private liberal arts college in Hamilton, New York. Founded in 1817, Colgate enrolls nearly 3,000 students in 56 undergraduate majors that culminate in a Bachelor of Arts degree; it also enrolls a dozen students in a Master of Arts in Teaching program.

In mathematics, **topological graph theory** is a branch of graph theory. It studies the embedding of graphs in surfaces, spatial embeddings of graphs, and graphs as topological spaces. It also studies immersions of graphs.

Tucker did his undergraduate studies at Harvard University, graduating in 1967,^{ [1] } and obtained his Ph.D. from Dartmouth College in 1971, under the supervision of Edward Martin Brown.^{ [4] }

**Harvard University** is a private Ivy League research university in Cambridge, Massachusetts, with about 6,700 undergraduate students and about 15,250 post graduate students. Established in 1636 and named for its first benefactor, clergyman John Harvard, Harvard is the United States' oldest institution of higher learning, and its history, influence, and wealth have made it one of the world's most prestigious universities.

**Dartmouth College** is a private Ivy League research university in Hanover, New Hampshire, United States. Established in 1769 by Eleazar Wheelock, it is the ninth-oldest institution of higher education in the United States and one of the nine colonial colleges chartered before the American Revolution. Although founded as a school to educate Native Americans in Christian theology and the English way of life, Dartmouth primarily trained Congregationalist ministers throughout its early history. The university gradually secularized, and by the turn of the 20th century it had risen from relative obscurity into national prominence as one of the top centers of higher education.

Tucker's father, Albert W. Tucker, was also a professional mathematician, and his brother, Alan Tucker, and son, Thomas J. Tucker, are also professional mathematicians.

**Albert William Tucker** was a Canadian mathematician who made important contributions in topology, game theory, and non-linear programming.

**Alan Curtiss Tucker** is an American mathematician. He is a professor of applied mathematics at Stony Brook University, and the author of a widely used textbook on combinatorics; he has also made research contributions to graph theory and coding theory. He has had four children, Katie, Lisa, Edward, and James.

**Tomaž (Tomo) Pisanski** is a Slovenian mathematician working mainly in discrete mathematics and graph theory. In 1980 he calculated the genus of the Cartesian product of any pair of connected, bipartite, *d*-valent graphs using a method that was later called the *White–Pisanski method*. In 1982 Vladimir Batagelj and Pisanski proved that the Cartesian product of a tree and a cycle is Hamiltonian if and only if no degree of the tree exceeds the length of the cycle. They also proposed a conjecture concerning *cyclic Hamiltonicity* of graphs. Their conjecture was proved in 2005.

**Harold William Kuhn** was an American mathematician who studied game theory. He won the 1980 John von Neumann Theory Prize along with David Gale and Albert W. Tucker. A former Professor Emeritus of Mathematics at Princeton University, he is known for the Karush–Kuhn–Tucker conditions, for Kuhn's theorem, for developing Kuhn poker as well as the description of the Hungarian method for the assignment problem. Recently, though, a paper by Carl Gustav Jacobi, published posthumously in 1890 in Latin, has been discovered that anticipates by many decades the Hungarian algorithm.

In mathematics, topology generalizes the notion of triangulation in a natural way as follows:

**George Neil Robertson** is a mathematician working mainly in topological graph theory, currently a distinguished professor emeritus at the Ohio State University. He earned his B.Sc. from Brandon College in 1959, and his Ph.D. in 1969 at the University of Waterloo under his doctoral advisor William Tutte.

**Ernst Steinitz** was a German mathematician.

A **gain graph** is a graph whose edges are labelled "invertibly", or "orientably", by elements of a group *G*. This means that, if an edge *e* in one direction has label *g*, then in the other direction it has label *g*^{ −1}. The label function φ therefore has the property that it is defined differently, but not independently, on the two different orientations, or directions, of an edge *e*. The group *G* is called the **gain group**, φ is the **gain function**, and the value φ(*e*) is the **gain** of *e*. A gain graph is a generalization of a signed graph, where the gain group *G* has only two elements. See Zaslavsky.

**Thomas Tucker**, **Tommy Tucker** or **Tom Tucker** may refer to:

**Claude Jacques Berge** was a French mathematician, recognized as one of the modern founders of combinatorics and graph theory.

**Viggo Stoltenberg-Hansen**, born 1942, professor at Uppsala University, Department of Mathematics, is a Swedish mathematician/logician and expert on domain theory and recursion theory. Viggo received his PhD in Mathematics from University of Toronto in 1973, supervised by Douglas Clarke.

In graph theory, a **voltage graph** is a directed graph whose edges are labelled invertibly by elements of a group. It is formally identical to a gain graph, but it is generally used in topological graph theory as a concise way to specify another graph called the derived graph of the voltage graph.

In the fields of chemical graph theory, molecular topology, and mathematical chemistry, a **topological index** also known as a **connectivity index** is a type of a molecular descriptor that is calculated based on the molecular graph of a chemical compound. Topological indices are numerical parameters of a graph which characterize its topology and are usually graph invariant. Topological indices are used for example in the development of quantitative structure-activity relationships (QSARs) in which the biological activity or other properties of molecules are correlated with their chemical structure.

**János Pach** is a mathematician and computer scientist working in the fields of combinatorics and discrete and computational geometry.

**Lowell Wayne Beineke** is a professor of graph theory at Indiana University – Purdue University Fort Wayne. Beineke is known for his elegant characterization of line graphs in terms of the nine Forbidden graph characterization.

In the area of mathematics called combinatorial group theory, the **Schreier coset graph** is a graph associated with a group *G*, a generating set { *x*_{i} : *i* in *I* }, and a subgroup *H* ≤ *G*.

**John Rolfe Isbell** was an American mathematician, for many years a professor of mathematics at the University at Buffalo (SUNY).

**Bojan Mohar** is a Slovenian and Canadian mathematician, specializing in graph theory. He is a professor of mathematics at the University of Ljubljana and the holder of a Canada Research Chair in graph theory at Simon Fraser University in Vancouver, British Columbia, Canada.

**Roy Lee Adler** was an American mathematician.

- 1 2 Faculty web page, retrieved 2014-10-29.
- ↑ J. L. Gross and T. W. Tucker, Topological Graph Theory, Wiley Interscience, 1987
- ↑ Thomassen, Carsten (1988). "Review:
*Topological Graph Theory*, by Jonathan L. Gross and Thomas W. Tucker" (PDF).*Bull. Amer. Math. Soc. (N.S.)*.**19**(2): 560–561. doi:10.1090/s0273-0979-1988-15742-4. - ↑ Thomas William Tucker at the Mathematics Genealogy Project

This article about an American mathematician is a stub. You can help Wikipedia by expanding it. |

This page is based on this Wikipedia article

Text is available under the CC BY-SA 4.0 license; additional terms may apply.

Images, videos and audio are available under their respective licenses.

Text is available under the CC BY-SA 4.0 license; additional terms may apply.

Images, videos and audio are available under their respective licenses.