submit urlsubmit rss feedadd directory

article

In mathematics and computer science, graph theory has for its subject matter the properties of graphs. Informally speaking, a graph is a set of objects called points or vertices connected by links called lines or edges. In a graph proper, which is by default undirected, a line from point A to point B is considered to be the same thing as a line from point B to point A. In a digraph, short for directed graph, the two directions are counted as being distinct arcs or directed edges.

Structures that can be represented as graphs are ubiquitous, and many problems of practical interest can be represented by graphs. The link structure of a website could be represented by a directed graph: the vertices are the web pages available at the website and there's a directed edge from page A to page B if and only if A contains a link to B. The development of algorithms to handle graphs is therefore of major interest in computer science.

A graph structure can be extended by assigning a weight to each edge of the graph. Graphs with weights can be used to represent many different concepts; for example if the graph represents a road network, the weights could represent the length of each road.The only information a weighted graph provides as such is (a) the vertices, (b) the edges and (c) the weights. Therefore the example in which the weights represent the roads' lengths doesn't imply that the weights are merely redundant annotations: there is no actual topographical information associated with the graph, so unlike reading a map, measuring the distances between the vertices is completely meaningless -- without the weights, there would be no way of telling what the distance between the vertices is in real life. A digraph with weighted edges is called a network.

More on [ Graph theory ]


directory of related categories

 

 
 
Graph_Theory RSS feed
Graph Theory - Twitter Search

Next paper, day after tomorrow, Discrete structure & graph theory..
ishwarkanse (Ishwar Kanse) Wed, 16 Dec 2009 08:56:20 -0000
Next paper, day after tomorrow, Discrete structure & graph theory..
After studying graphs/graph theory for like 8 hours, I'm beginning to see how I could have figured out past programming assignments easily..
elbichoazul (Brad) Wed, 16 Dec 2009 08:06:26 -0000
After studying graphs/graph theory for like 8 hours, I'm beginning to see how I could have figured out past programming assignments easily..
December 23 Exmas, Constitution 7:00 - 8:00 am, Graph Theory 2:00 - 3:30 6 HOUR BREAK WTF!!!!!!
prince_steven (Stevenson Que) Wed, 16 Dec 2009 04:39:52 -0000
December 23 Exmas, Constitution 7:00 - 8:00 am, Graph Theory 2:00 - 3:30 6 HOUR BREAK WTF!!!!!!
@asteris These terms come from graph theory application over social networks
hakmem (Yiorgos Adamopoulos) Tue, 15 Dec 2009 20:52:00 -0000
@asteris These terms come from graph theory application over social networks
河原林先生は、Algorithmic Graph Minor Theoryっていう理論を進めている方で、Robertson、Seymourのグラフマイナー定理を利用してグラフアルゴリズムを新しい方向に発展させていかれているようだ。
salmonsnare (salmonsnare) Tue, 15 Dec 2009 15:48:11 -0000
河原林先生は、Algorithmic Graph Minor Theoryっていう理論を進めている方で、Robertson、Seymourのグラフマイナー定理を利用してグラフアルゴリズムを新しい方向に発展させていかれているようだ。
says studying Graph Theory now...I miss him... http://plurk.com/p/2zs2v8
darmaemaningo (darmae maningo) Tue, 15 Dec 2009 14:30:36 -0000
says studying Graph Theory now...I miss him... http://plurk.com/p/2zs2v8

 
Subscribe to Graph_Theory RSS feed

directory of related sites

A Constructive Approach to Graph Theory - Notes on a semiotic approach to constructing isomorphism invariants of graphs by John-Tagore Tevet.

404 A Journey through Intersection Graph County - By Erich Prisner.

A Survey of Distance-Transitive Graphs - By Arjeh M. Cohen.

Capillary Multi-Path Routing in a Network of a Directed Symmetric Graph - By Emin Gabrielyan.

Counting Hamilton Cycles in Product Graphs - By Frans Faase.

Fractal Instances of the Traveling Salesman Problem - By Pablo Moscato.

From the Even Cycle Mystery to the L-Matrix Problem and Beyond - By Michael Brundage.

Getgrats: General Theory of Graph Transformation Systems - A research network funded by the European Commission.

Graph Colorings with Local Constraints - A survey by Zsolt Tuza.

Graphnet Archives - Archives of the Graphnet mailing list from February 1990.

404 Graphs: Theory-Algorithms-Complexity - Resource collection maintained by Thomas Emden-Weinert.

500 Harmonious Colourings - Notes and bibliography by Keith Edwards.

Knight's Tour Problem - Solution for chess boards with upto 32 squares.

Multicommodity Problems - Instances and random generators of multicommodity flow and network design problems.

Network Resources for Colouring a Graph - Resources for formulating and solving coloring problems.

Other Graph Theory and Related Pages - Miscellaneous pages collected by Stephen C. Locke.

Parameters of Directed Strongly Regular Graphs - Parameters, constructions and nonexistence information for directed strongly regular graphs.

Regular Graphs Page - Tables of simple connected k-regular graphs on n vertices and girth at least g.
Meta Description: [ Regular Graphs Page ]

Sandpiles in Graphs - An application of cellular automata by Angela R. Kerns.
Meta Description: [ Sandpiles in Graphs ]

Signed, Gain and Biased Graphs - List of publications and manuscripts annotated by Thomas Zaslavsky.

Spectral Graph Theory - People, publications, research topics, open problems, events and resources.
Meta Description: [ The theory of graph spectra can, in a way, be considered as an attempt to utilize linear algebra including, in particular, the well-developed theory of matrices for the purposes of graph theory and its applications. ]

404 The Four Color Theorem - Computer aided proof of the four color theorem by Neil Robertson, Daniel P. Sanders, Paul Seymour and Robin Thomas.

The Hamiltonian Page - Hamiltonian cycle and path problems, their generalisations and variations.

404 Thrackles - Jon Perry's pages on the thrackle conjecture.

Traveling Salesman Problem - These pages report the history of the TSP and ongoing work to solve large instances.

TSP Generator - Generates a Traveling Salesman Problem map and data for a given set of US cities.

Graph_Theory related videos
Electrical - Networks, Signals and Systems
Next Video
Graph_Theory related videos

 

HOMEADVERTISINGABOUT US

articlesartsbusinesscomputersgameshealthhospitalshomekids & teensnewsmobilephysiciansrecreationreferenceregionalscienceshoppingsocietysportsworld


Submit a Site About Become an Editor