Some applications of graph theory to other parts of mathematics

Bertram, Edward; Horak, Peter
June 1999
Mathematical Intelligencer;Summer99, Vol. 21 Issue 3, p6
Academic Journal
Discusses some applications of graph theory to other parts of mathematics. Use of combinatorial methods in pure mathematics; Definition of terms in graph theory; Proofs of theorems in set theory, number theory, algebra and analysis.


Related Articles

  • Edge-Packing in Planar Graphs. Heath, L. S.; Vergara, J. P. C. // Theory of Computing Systems;1998, Vol. 31 Issue 6, p629 

    Maximum G Edge-Packing (EPack[sub G]) is the problem of finding the maximum number of edge-disjoint isomorphic copies of a fixed guest graph G in a host graph H. This paper investigates the computational complexity of edgepacking for planar guests and planar hosts. Edge-packing is solvable in...

  • Infinite Circulant Digraphs and Random Infinite Circulant Digraphs. Huang, Qiang Xiang; Meng, Ji Xiang; Zhang, Fu Ji // Acta Mathematica Sinica;2002, Vol. 18 Issue 4, p817 

    In this paper, we completely determine the connectivity of every infinite circulant digraphs and prove that almost all infinite circulant digraphs are infinitely strongly connected and therefore have both one- and two-way infinite Hamiltonian paths.

  • Online. Entin, Carli // Scholastic DynaMath;Jan2010, Vol. 28 Issue 4, p10 

    A quiz concerning bar graph interpretation is presented.

  • New Graph Decompositions with Applications to Emulations. Kaklamanis, C.; Krizanc, D.; Rao, S. // Theory of Computing Systems;1997, Vol. 30 Issue 1, p39 

    Focuses on cut-cover, a type of graph decomposition that combines the notion of graph separators and t-neighborhood covers. Cut-covers of planar and certain minor-excluded graphs; Ways to emulate any N-node bounded degree planar graph; Hypercube networks.

  • Graph Embeddings and Simplicial Maps. Heath, L. S. // Theory of Computing Systems;1997, Vol. 30 Issue 1, p51 

    Analyzes the embedding of a unidirected graph in another graph. Lower bounds on dilation for various guest and host graphs; Extension of the lower bounds in two directions; Bidecomposability.

  • How to make a graph four-connected. Győri, Ervin; Jordán, Tibor // Mathematical Programming;1999, Vol. 84 Issue 3, p555 

    Abstract. Two extremal-type versions of the connectivity augmentation problem are investigated. Using ear-decomposition theorems we prove that (i) every 2-connected graph on n vertices can be made 4-connected by adding at most n new edges, and (ii) every 3-connected and 3-regular graph on n is...

  • Factorization Index for Completely Positive Graphs. Zhang, Xiao Dong; Li, Jiong Sheng // Acta Mathematica Sinica;2002, Vol. 18 Issue 4, p823 

    In this paper, we prove that the set of all factorization indices of a completely positive graph has no gaps. In other words, we give an affirmative answer to a question raised by N. Kogan and A. Berman [8] in the case of completely positive graphs.

  • Explicit Sufficient Invariants for an Interacting Particle System. Itoh, Yoshiaki; Mallows, Colin // Journal of Applied Probability;Sep98, Vol. 35 Issue 3, p633 

    Provides information on a study which presents a class of explicit sufficient invariants for an interacting particle system on a graph G. Discussion on the class of multiparticle systems; Limit for graph and the two-leaf star; Corollaries for the graph.

  • Graph theory and its relevance to the modern world.  // South African Journal of Science;Jul98, Vol. 94 Issue 7, p358 

    Focuses on the relevance of graph theory in modern practical applications. Information about graph theory; Origin of the discipline; Examples of the use of graph theory in modern applications.


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics