WorldCat Identities

Gross, Jonathan L.

Overview
Works: 37 works in 134 publications in 1 language and 3,331 library holdings
Genres: Handbooks and manuals 
Roles: Author, Editor
Classifications: QA166, 511.5
Publication Timeline
.
Most widely held works about Jonathan L Gross
 
Most widely held works by Jonathan L Gross
Graph theory and its applications by Jonathan L Gross( Book )

25 editions published between 1998 and 2006 in English and held by 841 WorldCat member libraries worldwide

"Graph Theory and Its Applications is a comprehensive applications-driven 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
Topological graph theory by Jonathan L Gross( Book )

25 editions published between 1987 and 2013 in English and held by 556 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 )

10 editions published between 1983 and 1986 in English and Undetermined and held by 451 WorldCat member libraries worldwide

Fundamental programming concepts by Jonathan L Gross( Book )

7 editions published between 1972 and 1975 in English and Undetermined and held by 240 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 198 WorldCat member libraries worldwide

"Emphasizing the use of combinatorial methods in calculations, Combinatorial Methods with Computer Applications provides in-depth 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 153 WorldCat member libraries worldwide

Introduction to computer programming by Walter S Brainerd( Book )

3 editions published in 1979 in English and held by 138 WorldCat member libraries worldwide

Pascal by Charles H Goldberg( Book )

2 editions published in 1984 in English and held by 136 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

Fortran 77 fundamentals and style by Walter S Brainerd( Book )

5 editions published in 1985 in English and held by 95 WorldCat member libraries worldwide

WATFIV-S fundamentals and style by Walter S Brainerd( Book )

2 editions published in 1986 in English and held by 66 WorldCat member libraries worldwide

Handbook of graph theory by Jonathan L Gross( Book )

7 editions published between 2004 and 2014 in English and held by 21 WorldCat member libraries worldwide

"Over the past fty years, graph theory has been one of the most rapidly growing areas of mathematics. Since 1960, more than 10,000 di erent authors have published papers classi ed as graph theory by Math Reviews, and for the past decade, more than 1000 graph theory papers have been published each year. Not surprisingly, this Second Edition is about 450 pages longer than the First Edition, which appeared in 2004. This Handbook is intended to provide as comprehensive a view of graph theory as is feasible in a single volume. Many of our chapters survey areas that have large research communities, with hundreds of active mathematicians, and which could be developed into independent handbooks. The 89 contributors to this volume, 31 of whom are new to this edition, collectively represent perhaps as much as 90% or more of the main topics in pure and applied graph theory. Thirteen of the sections in the Second Edition cover newer topics that did not appear in the First Edition. Format In order to achieve this kind of comprehensiveness, we challenged our contributors to restrict their expository prose to a bare minimum, by adhering to the ready-reference style of the CRC Handbook series, which emphasizes quick accessibility for the non- expert. We thank the contributors for responding so well to this challenge. The 13 chapters of the Handbook are organized into 65 sections. Within each section, several major topics are presented. For each topic, there are lists of the essential de nitions and facts, accompanied by examples, tables, remarks, and in some cases, conjectures and open problems. Each section ends with a bibliography of references tied directly to that section. In many cases, these bibliographies are several pages long, providing extensive guides to the"
Handbook of graph theory and applications by Jonathan L Gross( Book )

3 editions published in 2003 in English and Undetermined and held by 11 WorldCat member libraries worldwide

Instructor's manual to accompany WATFIV-S fundamentals and style by Walter S Brainerd( Book )

1 edition published in 1986 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

A tight lower bound on the maximum genus of a simplicial graph by Jianer Chen( Book )

1 edition published in 1993 in English and held by 3 WorldCat member libraries worldwide

Abstract: "It is proved that every connected simplicial graph with minimum valence at least three has maximum genus at least one-quarter of its cycle rank. This follows from the technical result that every 3- regular simplicial graph except K₄ has a Xuong co-tree 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 non-simplicial graphs. This result on maximum genus leads to several immediate consequences for average genus."
Extensions of Whitney's theorem synthesizing 2-connected graphs by Jianer Chen( Book )

1 edition published in 1991 in English and held by 3 WorldCat member libraries worldwide

Abstract: "A classical theorem of Whitney motivates introdution [sic] of the concept of linear synthesis of 2-connected 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 2-connected if and only if it has a 2-connected linear synthesis from every 2-connected subgraph, that a graph without 2-valent vertices is 3-connected if and only if it has a 3- connected linear synthesis from the complete graph K₄, and that a simplicial graph without 2-valent vertices is 2-connected if and only if it has a 2-connected semisimplicial linear synthesis from the complete graph K₄."
A relationship of average genus to the graph isomorphism problem by Jianer Chen( Book )

1 edition published in 1991 in English and held by 3 WorldCat member libraries worldwide

Limit points for average genus by Jianer Chen( Book )

1 edition published in 1992 in English and held by 2 WorldCat member libraries worldwide

Abstract: "In part (I) of this paper, it is proved that there are no limit points for the set of values of average genus of 2-connected simplicial graphs and of 3-connected graphs. The need for such restrictions is now demonstrated by showing that infinitely many real numbers are limit points of values of average genus for 2-connected non- simplicial graphs. A systematic method for constructing such limit points is presented, and it is proved that this method is essentially the only way to construct limit points of values of average genus for 'homeomorphically nested' 2-connected graphs."
 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.53 (from 0.18 for Instructor ... to 0.99 for Gross, Jon ...)

Graph theory and its applications
Alternative Names
Gross, Jonathan

Gross, Jonathan 1941-

Gross, Jonathan Light 1941-

Light Gross, Jonathan 1941-

Languages
English (114)

Covers
Topological graph theoryMeasuring culture : a paradigm for the analysis of social organizationCombinatorial methods with computer applicationsHandbook of graph theoryHandbook of graph theory and applications