Silly question-Please answer quickly
- From: "babu" <nasif4003@xxxxxxxxx>
- Date: 14 Jan 2007 10:51:55 -0800
Can anybody give information about is there any theorem/formula for the
following..
if number of vertex is n then how many 3 connected cubic planar
graphs are possible?
For example, if n=4 then number of graphs possible=1
if n=6 then number of graphs possible=1
I found a link given below:
http://people.csse.uwa.edu.au/gordon/remote/cubicplanar/viewgraph.html
But here no formula is provided for n vertex.
Wishing quick reply
Babu
.
- Prev by Date: CALL FOR PAPERS: International Workshop on Theoretical and Algorithmic Aspects of Sensor and Ad-hoc Networks (WTASA'07)
- Next by Date: a DFA for the language L={w in {0,1}*|w does not contain the substring 001}
- Previous by thread: CALL FOR PAPERS: International Workshop on Theoretical and Algorithmic Aspects of Sensor and Ad-hoc Networks (WTASA'07)
- Next by thread: a DFA for the language L={w in {0,1}*|w does not contain the substring 001}
- Index(es):
Relevant Pages
|
