|
Cun-Quan Zhang
C.Q. Zhang (full name: Cun-Quan Zhang) was Eberly Distinguished ProfessorDistinguished Professors WVU catalog at , is a mathematician working mainly in . He received his Ph.D. (mathematics) in 1986 from , under the supervision of Brian Alspach. ...
|
Cycle Double Cover
In graph-theoretic mathematics, a cycle double cover is a collection of cycles in an undirected graph that together include each edge of the graph exactly twice. For instance, for any polyhedral graph, the faces of a convex polyhedron that represents the graph provide a double cover of the graph: each edge belongs to exactly two faces. It is an unsolved problem, posed by W. T. Tutte, Itai and Rodeh, George Szekeres and Paul Seymour and known as the cycle double cover conjecture, whether every bridgeless graph has a cycle double cover. The conjecture can equivalently be formulated in terms of graph embeddings, and in that context is also known as the circular embedding conjecture. Formulation The usual formulation of the cycle double cover conjecture asks whether every bridgeless undirected graph has a collection of cycles such that each edge of the graph is contained in exactly two of the cycles. The requirement that the graph be bridgeless is an obvious necessary condition for ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
West Virginia University
West Virginia University (WVU) is a public university, public Land-grant university, land-grant research university with its main campus in Morgantown, West Virginia, United States. Its other campuses are those of the West Virginia University Institute of Technology in Beckley, West Virginia, Beckley, Potomac State College of West Virginia University in Keyser, West Virginia, Keyser, and clinical campuses for the university's medical school at the Charleston Area Medical Center and Eastern Campus in Martinsburg, West Virginia, Martinsburg. WVU Extension Service provides outreach with offices in all 55 West Virginia counties. Enrollment for the fall 2023 semester was 24,200 for the main campus, while enrollment across all three non-clinical campuses was 26,791. The Morgantown campus offers more than 350 bachelor's, master's, doctoral, and professional degree programs throughout 13 colleges and schools, including that state's only law and dental schools. Faculty and alumni include 2 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
1952 Births
Events January–February * January 26 – Cairo Fire, Black Saturday in Kingdom of Egypt, Egypt: Rioters burn Cairo's central business district, targeting British and upper-class Egyptian businesses. * February 6 ** Princess Elizabeth, Duchess of Edinburgh, becomes monarch of the United Kingdom of Great Britain and Northern Ireland and the British Dominions: Canada, Australia, New Zealand, Union of South Africa, South Africa, Dominion of Pakistan, Pakistan and Dominion of Ceylon, Ceylon. The princess, who is on a visit to Kenya when she hears of the death of her father, King George VI, aged 56, takes the regnal name Elizabeth II. ** In the United States, a Artificial heart, mechanical heart is used for the first time in a human patient. *February 7 – New York City announces its first crosswalk devices to be installed. * February 14–February 25, 25 – The 1952 Winter Olympics, Winter Olympics are held in Oslo, Norway. * February 15 – The State Funeral of King Ge ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Living People
Purpose: Because living persons may suffer personal harm from inappropriate information, we should watch their articles carefully. By adding an article to this category, it marks them with a notice about sources whenever someone tries to edit them, to remind them of WP:BLP (biographies of living persons) policy that these articles must maintain a neutral point of view, maintain factual accuracy, and be properly sourced. Recent changes to these articles are listed on Special:RecentChangesLinked/Living people. Organization: This category should not be sub-categorized. Entries are generally sorted by family name In many societies, a surname, family name, or last name is the mostly hereditary portion of one's personal name that indicates one's family. It is typically combined with a given name to form the full name of a person, although several give .... Maintenance: Individuals of advanced age (over 90), for whom there has been no new documentation in the last ten ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Graph Theorists
Graph may refer to: Mathematics *Graph (discrete mathematics), a structure made of vertices and edges **Graph theory, the study of such graphs and their properties * Graph (topology), a topological space resembling a graph in the sense of discrete mathematics *Graph of a function * Graph of a relation *Graph paper *Chart, a means of representing data (also called a graph) Computing *Graph (abstract data type), an abstract data type representing relations or connections *graph (Unix), Unix command-line utility *Conceptual graph, a model for knowledge representation and reasoning *Microsoft Graph, a Microsoft API developer platform that connects multiple services and devices Other uses * HMS ''Graph'', a submarine of the UK Royal Navy See also * Complex network *Graf *Graff (other) *Graph database *Grapheme, in linguistics *Graphemics *Graphic (other) *-graphy (suffix from the Greek for "describe," "write" or "draw") *List of information graphics software *Stati ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
MathSciNet
MathSciNet is a searchable online bibliographic database created by the American Mathematical Society in 1996. It contains all of the contents of the journal ''Mathematical Reviews'' (MR) since 1940 along with an extensive author database, links to other MR entries, citations, full journal entries, and links to original articles. It contains almost 3.6 million items and over 2.3 million links to original articles. Along with its parent publication ''Mathematical Reviews'', MathSciNet has become an essential tool for researchers in the mathematical sciences. Access to the database is by subscription only and is not generally available to individual researchers who are not affiliated with a larger subscribing institution. For the first 40 years of its existence, traditional typesetting was used to produce the Mathematical Reviews journal. Starting in 1980 bibliographic information and the reviews themselves were produced in both print and electronic form. This formed the basis of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
DBLP
DBLP is a computer science bibliography website. Starting in 1993 at Universität Trier in Germany, it grew from a small collection of HTML files and became an organization hosting a database and logic programming bibliography site. Since November 2018, DBLP is a branch of Schloss Dagstuhl – Leibniz-Zentrum für Informatik (LZI). DBLP listed more than 5.4 million journal articles, conference papers, and other publications on computer science in December 2020, up from about 14,000 in 1995 and 3.66 million in July 2016. All important journals on computer science are tracked. Proceedings papers of many conferences are also tracked. It is mirrored at three sites across the Internet. For his work on maintaining DBLP, Michael Ley received an award from the Association for Computing Machinery (ACM) and the VLDB Endowment Special Recognition Award in 1997. Furthermore, he was awarded the ACM Distinguished Service Award for "creating, developing, and curating DBLP" in 2019. ''DBLP'' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hamilton Cycle
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. The computational problems of determining whether such paths and cycles exist in graphs are NP-complete; see Hamiltonian path problem for details. 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 inve ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hamiltonian Cycle
In the mathematics, mathematical field of graph theory, a Hamiltonian path (or traceable path) is a path (graph theory), path in an undirected or directed graph that visits each vertex (graph theory), vertex exactly once. A Hamiltonian cycle (or Hamiltonian circuit) is a cycle (graph theory), 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. The computational problems of determining whether such paths and cycles exist in graphs are NP-complete; see Hamiltonian path problem for details. 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 structur ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Nowhere-zero Flow
In graph theory, a nowhere-zero flow or NZ flow is a network flow that is nowhere zero. It is intimately connected (by duality) to coloring planar graphs. Definitions Let ''G'' = (''V'',''E'') be a digraph and let ''M'' be an abelian group. A map ''φ'': ''E'' → ''M'' is an ''M''-circulation if for every vertex ''v'' ∈ ''V'' :\sum_ \varphi(e) = \sum_ \varphi(e), where ''δ''+(''v'') denotes the set of edges out of ''v'' and ''δ''−(''v'') denotes the set of edges into ''v''. Sometimes, this condition is referred to as Kirchhoff's law. If ''φ''(''e'') ≠ 0 for every ''e'' ∈ ''E'', we call ''φ'' a nowhere-zero flow, an ''M''-flow, or an NZ-flow. If ''k'' is an integer and 0 < , ''φ''(''e''), < ''k'' then ''φ'' is a ''k''-flow. Other notions Let ''G'' = (''V'',''E'') be an ...[...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
