Re: Graph Theory

Thread:
JA:http://web.archive.org/web/20140301040001/http://permalink.gmane.org/gmane.science.philosophy.peirce/12012
JA:http://web.archive.org/web/20140301040053/http://permalink.gmane.org/gmane.science.philosophy.peirce/12016
JA:http://web.archive.org/web/20140301140001/http://permalink.gmane.org/gmane.science.philosophy.peirce/12020

Peirce List,

Here are a couple of online references:

First is the Mathworld entry for “Simple Graph” (or ''graph simpliciter''), which is what graph 
theorists usually mean by “graph” when the word is used without further qualification.

| Weisstein, Eric W. “Simple Graph”
| From MathWorld — A Wolfram Web Resource
| http://mathworld.wolfram.com/SimpleGraph.html

One of the ways that mathematicians speaking different dialects of jargon can tell whether they are 
talking about the same family of mathematical objects or not is to sort the objects according to one 
or more parameters or properties and then to enumerate how many objects fall into each sorting bin. 
The method is not infallible, since one occasionally encounters families of non-isomorphic objects 
that have the same counting sequence, but it's useful as a rule of thumb, especially in discrete 
mathematics.  In that spirit, here is the OEIS entry for the “number of graphs on n nodes” (points, 
vertices, whatever), which also contains a wealth of bibliographic and historical material.

| The On-Line Encyclopedia of Integer Sequences
| “Number of Graphs on n Unlabeled Nodes”
| https://oeis.org/A000088

Regards,

Jon

-- 

academia: http://independent.academia.edu/JonAwbrey
my word press blog: http://inquiryintoinquiry.com/
inquiry list: http://stderr.org/pipermail/inquiry/
isw: http://intersci.ss.uci.edu/wiki/index.php/JLA
oeiswiki: http://www.oeis.org/wiki/User:Jon_Awbrey
facebook page: https://www.facebook.com/JonnyCache
_______________________________________________
Inquiry mailing list
[email protected]
http://stderr.org/cgi-bin/mailman/listinfo/inquiry