Gould, Ronald
Overview
Works:  6 works in 38 publications in 1 language and 1,239 library holdings 

Genres:  Textbooks 
Roles:  Author, Arranger 
Classifications:  QA401, 510 
Publication Timeline
.
Most widely held works by
Ronald Gould
Mathematics in games, sports, and gambling : the games people play by
Ronald Gould(
Book
)
16 editions published between 2009 and 2016 in English and Undetermined and held by 731 WorldCat member libraries worldwide
"Only requiring high school algebra, the text offers flexibility in choosing what material to cover in a basic mathematics course. It covers permutations in the twodeck matching game so derangements can be counted, introduces graphs to find matches when looking at extensions of the fivecard trick, and studies lexicographic orderings and ideas of encoding for card tricks. The text also explores linear equations and weighted equations in the section on the NFL passer rating formula and presents graphing to show how data can be compared or displayed. For each topic, the author includes exercises based on real games and sports data."Page 4 of cover
16 editions published between 2009 and 2016 in English and Undetermined and held by 731 WorldCat member libraries worldwide
"Only requiring high school algebra, the text offers flexibility in choosing what material to cover in a basic mathematics course. It covers permutations in the twodeck matching game so derangements can be counted, introduces graphs to find matches when looking at extensions of the fivecard trick, and studies lexicographic orderings and ideas of encoding for card tricks. The text also explores linear equations and weighted equations in the section on the NFL passer rating formula and presents graphing to show how data can be compared or displayed. For each topic, the author includes exercises based on real games and sports data."Page 4 of cover
Graph theory by
Ronald Gould(
Book
)
17 editions published between 1988 and 2012 in English and Undetermined and held by 382 WorldCat member libraries worldwide
"An introductory text in graph theory, this treatment covers primary techniques and includes both algorithmic and theoretical problems. Algorithms are presented with a minimum of advanced data structures and programming details. This thoroughly corrected 1988 edition provides insights to computer scientists as well as mathematicians studying topology, algebra, and matrix theory"
17 editions published between 1988 and 2012 in English and Undetermined and held by 382 WorldCat member libraries worldwide
"An introductory text in graph theory, this treatment covers primary techniques and includes both algorithmic and theoretical problems. Algorithms are presented with a minimum of advanced data structures and programming details. This thoroughly corrected 1988 edition provides insights to computer scientists as well as mathematicians studying topology, algebra, and matrix theory"
Recitative and prayer : for trombone and organ by
Hector Berlioz(
)
1 edition published in 1993 and held by 8 WorldCat member libraries worldwide
1 edition published in 1993 and held by 8 WorldCat member libraries worldwide
Traceability in graphs by
Ronald Gould(
)
2 editions published between 1979 and 1980 in Undetermined and English and held by 2 WorldCat member libraries worldwide
2 editions published between 1979 and 1980 in Undetermined and English and held by 2 WorldCat member libraries worldwide
Partitioning vertices of a tournament into independet cycles by
G Chen(
Book
)
1 edition published in 1998 in English and held by 2 WorldCat member libraries worldwide
Abstract: "Let k be a positive integer. A strong digraph G is termed kconnected if the removal of any set of fewer than k vertices results in a strongly connected digraph. The purpose of this paper is to show that every kconnected tournament with at least k(k+27)/3 vertices contains the union of k vertexdisjoint directed cycles, that is, the vertex set of the tournament can be covered by exactly k independent directed cycles. This result establishes an affirmative answer to a question posed by Bollobás."
1 edition published in 1998 in English and held by 2 WorldCat member libraries worldwide
Abstract: "Let k be a positive integer. A strong digraph G is termed kconnected if the removal of any set of fewer than k vertices results in a strongly connected digraph. The purpose of this paper is to show that every kconnected tournament with at least k(k+27)/3 vertices contains the union of k vertexdisjoint directed cycles, that is, the vertex set of the tournament can be covered by exactly k independent directed cycles. This result establishes an affirmative answer to a question posed by Bollobás."
Textile effluent decolorization by activated carbon by
Ronald Gould(
Book
)
1 edition published in 1976 in English and held by 1 WorldCat member library worldwide
1 edition published in 1976 in English and held by 1 WorldCat member library worldwide
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Berlioz, Hector 18031869 Author
 Kagarice, Vern Arranger
 Li, Hao
 Chen, Guantao Author
 Dover Publications Publisher
 CRC Press Publisher
Useful Links
Associated Subjects
Dyes and dyeingWaste disposal GamblingMathematics GamesMathematics Graphic methods Graph theory Mathematical analysis Partitions (Mathematics) Paths and cycles (Graph theory) Problem solvingMathematical models SportsMathematics SymphoniesExcerpts, Arranged Tournaments (Graph theory) WaterPurificationColor removal
Alternative Names
Gould, Ron.
Gould, Ron 1950
Gould, Ronald.
Gould, Ronald 1950
Gould, Ronald J.
Gould, Ronald J. 1950
Gould, Ronald J. (Ronald James)
Gould, Ronald J. (Ronald James), 1950
Gould, Ronald James 1950
Ronald J. Gould Amerikaans wiskundige
رونالد جی. گلد
Languages
Covers