Gross, Jonathan L.
Overview
Works:  40 works in 181 publications in 1 language and 4,214 library holdings 

Genres:  Handbooks and manuals 
Roles:  Author, Editor, ed 
Classifications:  QA166, 511.5 
Publication Timeline
.
Most widely held works by
Jonathan L Gross
Graph theory and its applications by
Jonathan L Gross(
Book
)
29 editions published between 1998 and 2006 in English and held by 856 WorldCat member libraries worldwide
"Graph Theory and Its Applications is a comprehensive applicationsdriven textbook that provides material for several different courses in graph theory." "Topics include trees, connectivity, planarity, coloring; graphical models for electrical and communications networks and computer architectures; network optimization models for operations analysis, including scheduling and job assignment; voltage graphs, algebraic specification of graphs, and other topics that showcase the interplay between graph theory and algebra."Jacket
29 editions published between 1998 and 2006 in English and held by 856 WorldCat member libraries worldwide
"Graph Theory and Its Applications is a comprehensive applicationsdriven textbook that provides material for several different courses in graph theory." "Topics include trees, connectivity, planarity, coloring; graphical models for electrical and communications networks and computer architectures; network optimization models for operations analysis, including scheduling and job assignment; voltage graphs, algebraic specification of graphs, and other topics that showcase the interplay between graph theory and algebra."Jacket
Handbook of graph theory by
Jonathan L Gross(
Book
)
43 editions published between 2003 and 2017 in English and Undetermined and held by 653 WorldCat member libraries worldwide
The Handbook of Graph Theory is the most comprehensive singlesource guide to graph theory ever published. Bestselling authors Jonathan Gross and Jay Yellen assembled an outstanding team of experts to contribute overviews of more than 50 of the most significant topics in graph theoryincluding those related to algorithmic and optimization approaches as well as "pure" graph theory. They then carefully edited the compilation to produce a unified, authoritative work ideal for ready reference. Designed and edited with nonexperts in mind, the Handbook of Graph Theory makes information easy to find and easy to understand. The treatment of each topic includes lists of essential definitions and facts accompanied by examples, tables, remarks, and in some areas, conjectures and open problems. Each section contains a glossary of terms relevant to that topic and an extensive bibliography of references that collectively form an extensive guide to the primary research literature. The applications of graph theory are fast becoming ubiquitous.; Whether your primary area of interest lies in mathematics, computer science, engineering, or operations research, this handbook holds the key to unlocking graph theory's intricacies, applications, and potential
43 editions published between 2003 and 2017 in English and Undetermined and held by 653 WorldCat member libraries worldwide
The Handbook of Graph Theory is the most comprehensive singlesource guide to graph theory ever published. Bestselling authors Jonathan Gross and Jay Yellen assembled an outstanding team of experts to contribute overviews of more than 50 of the most significant topics in graph theoryincluding those related to algorithmic and optimization approaches as well as "pure" graph theory. They then carefully edited the compilation to produce a unified, authoritative work ideal for ready reference. Designed and edited with nonexperts in mind, the Handbook of Graph Theory makes information easy to find and easy to understand. The treatment of each topic includes lists of essential definitions and facts accompanied by examples, tables, remarks, and in some areas, conjectures and open problems. Each section contains a glossary of terms relevant to that topic and an extensive bibliography of references that collectively form an extensive guide to the primary research literature. The applications of graph theory are fast becoming ubiquitous.; Whether your primary area of interest lies in mathematics, computer science, engineering, or operations research, this handbook holds the key to unlocking graph theory's intricacies, applications, and potential
Topological graph theory by
Jonathan L Gross(
Book
)
26 editions published between 1987 and 2016 in English and held by 555 WorldCat member libraries worldwide
The use of topological ideas to explore various aspects of graph theory, and vice versa, is a fruitful area of research. This book contains 15 expository chapters written by acknowledged international experts in the field
26 editions published between 1987 and 2016 in English and held by 555 WorldCat member libraries worldwide
The use of topological ideas to explore various aspects of graph theory, and vice versa, is a fruitful area of research. This book contains 15 expository chapters written by acknowledged international experts in the field
Measuring culture : a paradigm for the analysis of social organization by
Jonathan L Gross(
Book
)
11 editions published between 1983 and 1986 in English and Undetermined and held by 452 WorldCat member libraries worldwide
11 editions published between 1983 and 1986 in English and Undetermined and held by 452 WorldCat member libraries worldwide
Fundamental programming concepts by
Jonathan L Gross(
Book
)
6 editions published between 1972 and 1975 in English and Undetermined and held by 231 WorldCat member libraries worldwide
6 editions published between 1972 and 1975 in English and Undetermined and held by 231 WorldCat member libraries worldwide
Combinatorial methods with computer applications by
Jonathan L Gross(
Book
)
12 editions published between 2007 and 2008 in English and held by 204 WorldCat member libraries worldwide
"Emphasizing the use of combinatorial methods in calculations, Combinatorial Methods with Computer Applications provides indepth coverage of recurrences, generating functions, partitions, and permutations, along with some of the most interesting graph and network topics, design constructions, and finite geometries." "Paving the way for readers to understand and perform combinatorial calculations, this accessible text presents the discrete methods necessary for applications to algorithmic analysis, performance evaluation, and statistics as well as for the solution of combinatorial problems in engineering and the social sciences."Jacket
12 editions published between 2007 and 2008 in English and held by 204 WorldCat member libraries worldwide
"Emphasizing the use of combinatorial methods in calculations, Combinatorial Methods with Computer Applications provides indepth coverage of recurrences, generating functions, partitions, and permutations, along with some of the most interesting graph and network topics, design constructions, and finite geometries." "Paving the way for readers to understand and perform combinatorial calculations, this accessible text presents the discrete methods necessary for applications to algorithmic analysis, performance evaluation, and statistics as well as for the solution of combinatorial problems in engineering and the social sciences."Jacket
Fortran 77 programming by
Walter S Brainerd(
Book
)
6 editions published in 1978 in English and held by 149 WorldCat member libraries worldwide
6 editions published in 1978 in English and held by 149 WorldCat member libraries worldwide
Introduction to computer programming by
Walter S Brainerd(
Book
)
3 editions published in 1979 in English and held by 137 WorldCat member libraries worldwide
3 editions published in 1979 in English and held by 137 WorldCat member libraries worldwide
Pascal by
Charles H Goldberg(
Book
)
2 editions published in 1984 in English and held by 134 WorldCat member libraries worldwide
2 editions published in 1984 in English and held by 134 WorldCat member libraries worldwide
Pascal programming : a spiral approach by
Walter S Brainerd(
Book
)
3 editions published in 1982 in English and held by 128 WorldCat member libraries worldwide
3 editions published in 1982 in English and held by 128 WorldCat member libraries worldwide
Fortran 77 fundamentals and style by
Walter S Brainerd(
Book
)
4 editions published in 1985 in English and held by 90 WorldCat member libraries worldwide
4 editions published in 1985 in English and held by 90 WorldCat member libraries worldwide
WATFIVS fundamentals and style by
Walter S Brainerd(
Book
)
2 editions published in 1986 in English and held by 68 WorldCat member libraries worldwide
2 editions published in 1986 in English and held by 68 WorldCat member libraries worldwide
Handbook of graph theory and applications by
Jonathan L Gross(
Book
)
2 editions published in 2003 in English and held by 11 WorldCat member libraries worldwide
2 editions published in 2003 in English and held by 11 WorldCat member libraries worldwide
Instructor's manual to accompany Fortran 77 fundamentals and style by
Walter S Brainerd(
Book
)
1 edition published in 1985 in English and held by 7 WorldCat member libraries worldwide
1 edition published in 1985 in English and held by 7 WorldCat member libraries worldwide
Instructor's manual to accompany Fundamental programming concepts by
Jonathan L Gross(
Book
)
1 edition published in 1972 in English and held by 5 WorldCat member libraries worldwide
1 edition published in 1972 in English and held by 5 WorldCat member libraries worldwide
Extensions of Whitney's theorem synthesizing 2connected graphs by
Jianer Chen(
Book
)
2 editions published in 1991 in English and held by 4 WorldCat member libraries worldwide
Abstract: "A classical theorem of Whitney motivates introdution [sic] of the concept of linear synthesis of 2connected graphs. By applying Tutte's theory of bridges, an entirely different proof for Whitney's theorem is obtained and strengthened in several directions. In particular, it is proved that a graph is 2connected if and only if it has a 2connected linear synthesis from every 2connected subgraph, that a graph without 2valent vertices is 3connected if and only if it has a 3 connected linear synthesis from the complete graph K₄, and that a simplicial graph without 2valent vertices is 2connected if and only if it has a 2connected semisimplicial linear synthesis from the complete graph K₄."
2 editions published in 1991 in English and held by 4 WorldCat member libraries worldwide
Abstract: "A classical theorem of Whitney motivates introdution [sic] of the concept of linear synthesis of 2connected graphs. By applying Tutte's theory of bridges, an entirely different proof for Whitney's theorem is obtained and strengthened in several directions. In particular, it is proved that a graph is 2connected if and only if it has a 2connected linear synthesis from every 2connected subgraph, that a graph without 2valent vertices is 3connected if and only if it has a 3 connected linear synthesis from the complete graph K₄, and that a simplicial graph without 2valent vertices is 2connected if and only if it has a 2connected semisimplicial linear synthesis from the complete graph K₄."
A tight lower bound on the maximum genus of a simplicial graph by
Jianer Chen(
Book
)
2 editions published in 1993 in English and held by 4 WorldCat member libraries worldwide
Abstract: "It is proved that every connected simplicial graph with minimum valence at least three has maximum genus at least onequarter of its cycle rank. This follows from the technical result that every 3 regular simplicial graph except K₄ has a Xuong cotree whose odd components have only one edge each. It is proved, furthermore, that this lower bound is tight. However, examples are used to illustrate that it does not apply to nonsimplicial graphs. This result on maximum genus leads to several immediate consequences for average genus."
2 editions published in 1993 in English and held by 4 WorldCat member libraries worldwide
Abstract: "It is proved that every connected simplicial graph with minimum valence at least three has maximum genus at least onequarter of its cycle rank. This follows from the technical result that every 3 regular simplicial graph except K₄ has a Xuong cotree whose odd components have only one edge each. It is proved, furthermore, that this lower bound is tight. However, examples are used to illustrate that it does not apply to nonsimplicial graphs. This result on maximum genus leads to several immediate consequences for average genus."
A relationship of average genus to the graph isomorphism problem by
Jianer Chen(
Book
)
2 editions published in 1991 in English and held by 4 WorldCat member libraries worldwide
2 editions published in 1991 in English and held by 4 WorldCat member libraries worldwide
HTML advanced reference by
James C Armstrong(
Book
)
1 edition published in 1996 in English and held by 3 WorldCat member libraries worldwide
1 edition published in 1996 in English and held by 3 WorldCat member libraries worldwide
Instructor's manual to accompany PASCAL by
Charles H Goldberg(
Book
)
1 edition published in 1984 in English and held by 3 WorldCat member libraries worldwide
1 edition published in 1984 in English and held by 3 WorldCat member libraries worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Yellen, Jay Author Editor
 Brainerd, Walter S. Author
 Goldberg, Charles H. Author
 Tucker, Thomas W.
 Rayner, Steve 1953
 Zhang, Ping Editor
 Beineke, Lowell W.
 Wilson, Robin J.
 Chen, Jianer Author
 Specialized Systems Consultants
Associated Subjects
BASIC (Computer program language) Canada Combinatorial analysisData processing Computer programming Corporate cultureData processing Corporate cultureMathematical models CultureData processing CultureMathematical models FORTRAN (Computer program language) FORTRAN (Computer program language)Study and teaching FORTRAN 77 (Computer program language) Graph theory HTML (Document markup language) Pascal (Computer program language) Pascal (Computer program language)Study and teaching RiskData processing RiskMathematical models Risk perceptionData processing Risk perceptionMathematical models Scientists Social structureData processing Social structureMathematical models Topological graph theory Topology United States
Alternative Names
Gross, Jonathan
Gross, Jonathan 1941
Gross, Jonathan Light 1941
Light Gross, Jonathan 1941
Languages
Covers