Mathematics

  2013 MAY 14 (VerticalNews) -- By a News Reporter-Staff News Editor at Journal of Mathematics -- Current study results on Combinatorics have been published. According to news originating from Brisbane, Australia, by VerticalNews correspondents, research stated, "A 1-factorisation of a graph G is a decomposition of G into edge-disjoint 1-factors (perfect matchings), and a perfect 1-factorisation is a 1-factorisation in which the union of any two of the 1-factors is a Hamilton cycle. ...read more

  2013 MAY 14 (VerticalNews) -- By a News Reporter-Staff News Editor at Journal of Mathematics -- Current study results on Combinatorics have been published. According to news reporting out of Manchester, New Hampshire, by VerticalNews editors, the research stated, "A labeling of a graph is a function from the vertex set of the graph to some finite set. Certain dynamical systems (such as topological Markov shifts) can be defined by directed graphs. ...read more

  2013 MAY 14 (VerticalNews) -- By a News Reporter-Staff News Editor at Journal of Mathematics -- New research on Combinatorics is the subject of a report. According to news reporting from Notre Dame, Indiana, by VerticalNews journalists, research stated, "For a graph G and a positive integer k, the graphical Stirling number S(G,k) is the number of partitions of the vertex set of G into k non-empty independent sets. Equivalently it is the number of proper colorings of G that use exactly k colors, with two colorings identified if they differ only on the names of the colors. ...read more