Home  - Science - Graph Theory

Books Baby Camera Phones Computers Games DVD Electronics Kitchen Magazines Music Garden Software Tools Toys Video Apparel & Accessories Jewelry & Watches Musical Instruments Health & Personal Care Beauty Sports & Outdoors Office Products

e99.com Bookstore

Images

Newsgroups

81-100 of 166    Back | 1  | 2  | 3  | 4  | 5  | 6  | 7  | 8  | 9  | Next 20

A  B  C  D  E  F  G  H  I  J  K  L  M  N  O  P  Q  R  S  T  U  V  W  X  Y  Z

Graph Theory:     more books (100)

Quantum Probability and Spectral Analysis of Graphs (Theoretical and Mathematical Physics) by Akihito Hora, Nobuaki Obata, 2010-11-02 Graph Theory and Its Engineering Applications (Advanced Series in Electrical and Computer Engineering) by Wai-Kai Chen, 1997-02 Graphs and Applications: Proceedings of the First Colorado Symposium on Graph Theory Eigenspaces of Graphs (Encyclopedia of Mathematics and its Applications) by Dragos Cvetkovic, Peter Rowlinson, et all 2008-03-01 The Logic System of Concept Graphs with Negation: And Its Relationship to Predicate Logic (Lecture Notes in Computer Science) by Frithjof Dau, 2004-01-22 A Friendly Introduction to Graph Theory by Fred Buckley, Marty Lewinter, 2002-11-14 A Textbook of Graph Theory (Universitext) by R. Balakrishnan, K. Ranganathan, 1999-12-17 Discrete Groups, Expanding Graphs and Invariant Measures: Appendix by Jonathan D. Rogawski (Modern Birkhäuser Classics) by Alex Lubotzky, 2009-11-23 Combinatorial Algorithms: Theory and Practice by Edward M. Reingold, 1977-06 Network Science: Theory and Applications by Ted G. Lewis, 2009-03-11 Young Tableaux: With Applications to Representation Theory and Geometry (London Mathematical Society Student Texts) by William Fulton, 1996-12-28 Set Theory, Logic and their Limitations by Moshe Machover, 1996-05-31 Theory and Application of Graphs (Network Theory and Applications) by Junming Xu, 2003-07-31 Topological Graph Theory by Jonathan L. Gross, Thomas W. Tucker, 2001-06-13

lists with details

81. Cabri-graphs
    Free Macintosh software for graph theory.  
    http://www-cabri.imag.fr/CabriGraphes/cabri_anglais/gb_cabri_graph.html

82. Graph Theory : Definition And Properties
    graph theory Definition and Properties. graph theory is a branch of mathematicsconcerned about how networks can be encoded and their properties measured.  
    http://people.hofstra.edu/geotrans/eng/ch2en/meth2en/ch2m1en.html
    
    Extractions: Chapter 2 - Methods (PowerPoint) Graph Theory: Definition and Properties Author : Dr. Jean-Paul Rodrigue 1. Basic Graph Definition A graph is a symbolic representation of a network. It implies an abstraction of the reality so it can be simplified as a set of linked nodes. Graph theory is a branch of mathematics concerned about how networks can be encoded and their properties measured. Graph. A transportation network, like any network, can be represented as a graph. A graph G is a set of vertex (nodes) v connected by edges (links) e . Thus G=(v , e) Vertex (Node). A node v is a terminal point or an intersection point of a graph. It is the abstraction of a location such as a city, an administrative division, a road intersection or a transport terminal (stations, terminuses, harbors and airports). Edge (Link). An edge e is a link between two nodes. The link ( i j ) is of initial extremity i and of terminal extremity j . A link is the abstraction of a transport infrastructure supporting movements between nodes. It has a direction that is commonly represented as an arrow. When an arrow is not used, it is assumed the link is bi-directional.

83. Satellite Conference Of ICM-2002
    Hong Kong University of Science and Technology; 1517 August 2002.  
    http://www.math.ust.hk/conference/
    
    Extractions: Combinatorics, Graph Theory and Applications Satellite Conference of ICM-2002 15-17 August 2002 Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong The conference is to provide an opportunity for people to discuss the most recent ideas and advances in combinatorics and graph theory. Topics range from traditional problems to new directions, applications, and interactions with other fields. Confirmed Speakers: Noga Alon Tel Aviv, Israel Bela Bollobas Cambridge, UK; Memphis, USA Christian Borgs Microsoft, USA

84. Patrice Ossona De Mendez - Home
    ‰cole des Hautes Etudes en Sciences Sociales, Paris. Topological graph theory; Combinatorics; Pliant programming.  
    http://www.ehess.fr/centres/cams/person/pom/index.html

85. Search Graph Bibliography
    At the University of Alberta.Category Science Math Combinatorics graph theory ReferencesSearch Graph Biblilography. This form will of Operational Research}}Back to the graph Page. stewart@cs.ualberta.ca, July 29, 1995.  
    http://www.cs.ualberta.ca/~stewart/GRAPH/search/bibsearch.html
    
    Extractions: Third Search Term: The search engine is based on an ancient Perl script written by Dr. Joe Culberson in University of Alberta. A record is reported if the patterns match anywhere in the bibTeX record. All matches are done on lower case after non-alphabetic characters in the bibTeX file are eliminated. Thus, setting the First Search term to "erdos" and the Second to "bollobas" will retrieve a record containing the field as well as two references in a volume honoring Erdos and edited by Bollobas. The bibTeX file contains a number of string definitions used throughout. To determine the definition of a string in a bibTeX record, set the output format to bibTeX , then use the string in the First Search Term and the word "string" in the Second. For example, setting the first to "ejor" and the second to "string" results in the output

86. Problems Ex Cameron's Homepage
    Maintained by Peter Cameron.Category Science Math Combinatorics graph theory Open Problems in asking this question is in the paper The algebra of an age, in Model Theory ofGroups 5. Let G be a finite graph, and X(G) the class of graphs containing no  
    http://www.maths.qmw.ac.uk/~pjc/oldprob.html
    
    Extractions: Problems These are problems which have been on my homepage and are now put out to grass. See also permutation group problems 1. In 1956, Rudin defined a permutation of the integers which maps 3 x to 2 x x +1 to 4 x +1, and 3 x -1 to 4 x -1 for all x Problem: Determine the cycle structure of this permutation. I have just learned (December 1998) that this problem is older: it is the "original Collatz problem" from the 1930s (before the famous 3 x +1 problem). A paper by Jeff Lagarias gives details. 2. Let f k,n ) be the number of rooted trees with n leaves, all at level k (that is, distance k from the root), up to isomorphism of rooted trees. Prove that f k n f k,n ) tends to infinity with n , for fixed k . Is it even true that f k n f k,n ) is at least 1 + ( n k Solution by Peter Johnson. Let r be the maximum number of edges from a vertex on one level to the next level, in a tree with n vertices at level k . Then r k is at least n , so r is at least n k From any tree of height k +1, we obtain at most k different trees of height k by suppressing one level (replacing the paths of length 2 crossing this level by single edges). But there is some tree of height k from which at least p n k trees of height k +1 can be recovered by introducing a new level. (Choose a level where some vertex has at least

87. Fifth Slovenian International Conference On Graph Theory
    Fifth Slovenian International Conference On graph theory. June 2227,2003, Bled, Slovenia. Last updated 28.1.2003 The information  
    http://www.educa.fmf.uni-lj.si/matjaz/Bled/
    
    Extractions: Last updated: 7.2.2003 The information on the following topics is available: IMPORTANT INSTRUCTIONS Payment of registration fee (for foreign participants), hotel and transfer reservations are handled by agency Albatros Bled . Registration for the conference is handled by the organizers. Registration: If you want to take part at the conference, please register here Payment (foreign participants): To pay the conference fee, please use Albatros form . Payment options are credit card payment and bank transfer. To receive early registration fee, the fee must be paid before May 15, 2003. Participants from Slovenia are adviced to contact the organizers about payment details. Hotels: If you want to stay in one of the conference hotels, make a reservation through Albatros form (deadline May 15, 2003). It is also possible to make your own arrangement, click e.g.

88. Seventh North Carolina Mini-Conference
    Appalachian State University, Boone, NC, USA; 12 April 2002.  
    http://www.cs.appstate.edu/~aam/Conference2002/
    
    Extractions: The Departments of Computer Science and Mathematical Sciences at Appalachian State University are pleased to announce the Seventh North Carolina Mini-Conference on Graph Theory, Combinatorics, and Computing. The conference will be held on Friday, April 12th, 2002. We have a preliminary schedule of talks. The conference will be held at the Plemmons Student Union Building (note: this is different from last year). Parking is available at First Baptist Church on King Street (hang tags are needed). We plan to have someone in the church lot to direct parking and give out hang tags. One of the goals of this conference is to provide a venue in which students can present their work, and so we especially encourage students (undergraduate and graduate) to consider giving talks. Each speaker will have 20 minutes for his/her presentation with 5 additional minutes for questions. A conference luncheon will take place again this year. During the luncheon, participants will have the opportunity to interact with one another discussing areas of common interest and making valuable connections with others in our region. The luncheon will be free for everyone who has registered before April 8th. After lunch we will hear from our featured speaker, Peter Slater, professor of mathematics at the University of Alabama(Huntsville). Our aim is for this conference to be beneficial to both the faculty and the students of our region. We hope that you will be able to be with us on this day, and we hope that you will encourage others to attend.

89. The Electronic Journal Of Combinatorics
    A refereed allelectronic journal that welcomes papers in all branches of discrete mathematics, including all kinds of combinatorics, graph theory, discrete algorithms. Full text is available free on-line.  
    http://www.combinatorics.org/

90. Feedback Form
    Dedicated to Professor Henda C. Swart and Professor Izak Broere, the pioneers of graph theory in South Africa. Ntshondwe Camp, Ithala Game Reserve, KwaZuluNatal, South Africa; 1822 June 2001.  
    http://saturn.cs.unp.ac.za/saigtc/saigtcf.html
    
    Extractions: South African International Graph Theory Conference June 18-22, 2001 To be held at Ntshondwe Camp, Ithala Game Reserve, KwaZulu-Natal, South Africa Hosted by University of Natal The South African International Graph Theory Conference is to be held during June 18-22, 2001 and is dedicated to Professor Henda C. Swart and Professor Izak Broere, the pioneers of graph theory in South Africa. The conference will be held at Ntshondwe Camp, Ithala Game Reserve , situated in KwaZulu-Natal, South Africa and hosted by the University of Natal. The main goal of the conference is to explore the most recent research in graph theory. The Principal Talks will be scheduled for 25 minutes and contributed talks for 15 minutes. Special functions during the week includes a night drive in open safari vehicles, breakfast at the Bird Hide, sundowners overlooking the beautiful Phongola River, a night bush braai (alias ''barbeque'') and a Zulu dancing exhibition. The Principal Speakers are:

91. Graph Theory
    graph theory. Graph Connections Relationships Between graph theory and Other Areasof Mathematics. Oxford, England Oxford University Press, 1997. 304 p. $65.  
    http://www.ericweisstein.com/encyclopedias/books/GraphTheory.html
    
    Extractions: see also Combinatorics Four-Color Problem Graph Theory Avondo Bodino, Giuseppe. Economic Applications of the Theory of Graphs. New York: Gordon and Breach, Science Publishers, 1962. 111 p. $?. Beinecke, Lowell Wayne and Wilson, Robin James (Eds.). Graph Connections: Relationships Between Graph Theory and Other Areas of Mathematics. Oxford, England: Oxford University Press, 1997. 304 p. $65. Berge, Claude. Graphs and Hypergraphs, 2nd rev. ed. Amsterdam, Netherlands: North-Holland, 1976. 528 p. $138. Berge, Claude. Hypergraphs: The Theory of Finite Sets. Amsterdam, Netherlands: North-Holland, 1989. 255 p. $?. Berge, Claude. The Theory of Graphs and Its Applications. New York: Wiley, 1962. 247 p. $?. Biggs, Norman L. Algebraic Graph Theory, 2nd ed. Cambridge, England: Cambridge University Press, 1993. 205 p. $26.95. Biggs, Norman L.; Lloyd, E. Keith; and Wilson, Robin J. Graph Theory 1736-1936. Oxford, England: Oxford University Press, 1976. $45. Graph Theory: An Introductory Course. New York: Springer-Verlag, 1979. 180 p. $43.50. Modern Graph Theory.

92. GRAPH THEORY
    Math Archives Homepage graph theory. David Lovelock, Andy Halper and ChandiHunt Department of Mathematics University of Arizona Tucson, Arizona 85721.  
    http://archives.math.utk.edu/software/msdos/discrete.math/graph/.html
    
    Extractions: Tucson, Arizona 85721 This self-extracting program will allow you to experiment with undirected, unweighted graphs. It can also decide whether a graph is planar, connected, has an Euler circuit, Euler path, or Hamilton cycle. The graph can have up to 26 vertices. Download graph.exe [211 KB]. Look at other programs in the University of Arizona collection.

93. Boost Graph Library: Graph Theory Review
    Review of Elementary graph theory. This chapter is meant as a refresheron elementary graph theory. If the reader has some previous  
    http://www.boost.org/libs/graph/doc/graph_theory_review.html
    
    Extractions: This chapter is meant as a refresher on elementary graph theory. If the reader has some previous acquaintance with graph algorithms, this chapter should be enough to get started. If the reader has no previous background in graph algorithms we suggest a more thorough introduction such as Introduction to Algorithms by Cormen, Leiserson, and Rivest. A graph is a mathematical abstraction that is useful for solving many kinds of problems. Fundamentally, a graph consists of a set of vertices, and a set of edges, where an edge is something that connects two vertices in the graph. More precisely, a graph is a pair (V,E) , where V is a finite set and E is a binary relation on V V is called a vertex set whose elements are called vertices E is a collection of edges, where an edge is a pair (u,v) with u,v in V . In a directed graph , edges are ordered pairs, connecting a source vertex to a target vertex. In an undirected graph edges are unordered pairs and connect the two vertices in both directions, hence in an undirected graph (u,v)

94. Open Problems In Graph Theory Involving Steiner Distance
    Open Problems involving Steiner distance.Category Science Math Combinatorics graph theory Open ProblemsSome Open Problems in graph theory. It has been shown by Chartrand,Oellermann, Tian, and Zou that, for a tree T diam n T = n/(n  
    http://www.uwinnipeg.ca/~ooellerm/open_problems/
    
    Extractions: This inequality does not hold for graphs in general as was shown by Henning, Oellermann, and Swart . It was shown in the same paper that for a graph G and n=3 and 4: diam n n G. It was shown by Oellermann and Tian that for a tree T: C n-1 (T) is contained in C n It remains an open problem to determine whether this containment holds for general graphs. In other words, it is not known if the Steiner (n-1)-center of a graph is contained in its Steiner n-center. It was shown by Beineke, Oellermann and Pippert that if T is a tree, then M n-1 (T) is contained in M n It remains an open problem to determine whether this containment holds for general graphs. In other words, it is not known if the Steiner (n-1)-median of a graph is contained in its Steiner n-median. Oellermann and Tian ). It is known that every graph is the 2-median of some graph (see Holbert ,and Hendry ). Steiner n-medians of trees have been completely characterized by

95. Finite And Infinite Combinatorics
    Topics include graph theory, extremal and random graphs, combinatorial optimization and number theory, discrepancy theory, infinite combinatorics, and set theory. Budapest, Hungary, January 510, 2001.  
    http://www.renyi.hu/~finf/
    
    Extractions: Finite and Infinite Combinatorics Dear Colleagues, The special occasion for this meeting is to honour the 70th birthdays of Professors and Download the list of the presented talks in DVI format or in PostScript format. Download the list of participants in DVI format or in PostScript format We thank all participants for coming to Budapest The Organizing Commitee

96. Topics In Intersection Graph Theory By TA McKee And FR McMorris
    Topics in Intersection graph theory by TA McKee and FR McMorris. Bibliographicinformation. Table of Contents. Topics in intersection graph theory.  
    http://www.math.wright.edu/People/Terry_McKee/Button_04_Book.html

97. SIAM Journal On Discrete Mathematics
    The SIAM Journal on Discrete Mathematics publishes research articles on a broad range of topics from pure and applied mathematics including combinatorics and graph theory, discrete optimization and operations research, theoretical computer science, and coding and communication theory.  
    http://www.siam.org/journals/sidma/sidma.htm
    
    Extractions: search: SIAM Journal on Discrete Mathematics Jerrold R. Griggs, Editor-in-Chief The SIAM Journal on Discrete Mathematics publishes research articles on a broad range of topics from pure and applied mathematics including combinatorics and graph theory, discrete optimization and operations research, theoretical computer science, and coding and communication theory. Click Here for the latest issues. Questions/Comments about our Web pages? Use our suggestion box or send e-mail to the Online Services Manager. About SIAM Membership Journals SIAM News ...

98. CIRM/DONET Graph Theory Workshop
    The 2000 CIRMDONET WORKSHOP on graph theory May 7-12, 2000 Levico,Trento, Italy List of participants THE PROGRAM -, Robin Thomas  
    http://homepages.cwi.nl/~bgerards/GRAPHSHOP/
    
    Extractions: The workshop was open to everyone interested. So not restricted to DONET members. 68 senior and junior researchers in Graph Theory participated at the workshop. They came from all over the world: Brasil, Canada, Czech Republic, France, Germany, Hungary, Italy, Japan, Mexico, The Netherlands, New Zealand, Saudi Arabia, Slovenia, United Kingdom, and the USA (see list of participants

99. EuroConference On Combinatorics, Graph Theory And Applications
    Centre de Recerca Matem tica, Campus of the Universitat Aut²noma de Barcelona, Spain; 1215 September 2001.  
    http://www.crm.es/comb01/combgraphtheo.htm

100. Graph Theory -- From MathWorld
     graph theory, Graph Connections Relationships Between graph theory and OtherAreas of Mathematics. Oxford, England Oxford University Press, 1997.  
     http://mathworld.wolfram.com/GraphTheory.html
     
     Extractions: References Beinecke, L. W. and Wilson, R. J. (Eds.). Graph Connections: Relationships Between Graph Theory and Other Areas of Mathematics. Oxford, England: Oxford University Press, 1997. Berge, C. Graphs and Hypergraphs. Amsterdam, Netherlands: North-Holland, 1976. Berge, C. The Theory of Graphs and Its Applications. New York: Wiley, 1962. Bogomolny, A. "Graphs." http://www.cut-the-knot.org/do_you_know/graphs.shtml Graph Theory: An Introductory Course. New York: Springer-Verlag, 1979. Modern Graph Theory. New York: Springer-Verlag, 1998. Caldwell, C. K. "Graph Theory Tutorials." http://www.utm.edu/departments/math/graph/ Chartrand, G. Introductory Graph Theory. New York: Dover, 1985. Emden-Weinert, T. "Graphs: Theory-Algorithms-Complexity." http://people.freenet.de/Emden-Weinert/graphs.html Foulds, L. R. Graph Theory Applications.

A  B  C  D  E  F  G  H  I  J  K  L  M  N  O  P  Q  R  S  T  U  V  W  X  Y  Z

81-100 of 166    Back | 1  | 2  | 3  | 4  | 5  | 6  | 7  | 8  | 9  | Next 20