[Nauty] Re: nauty-list digest, Vol 1 #51 - 2 msgs

Wahid Chrabakh chrabakh at cs.ucsb.edu
Sun Feb 1 03:28:01 EST 2004


Hi:
	Thank you for your response.
	However I am not still sure I understand this completely.
	Can you send me some sample code and a pointer for detailed
	explanation.
	I read the NAUTY manual but I am not sure where the realted info is.

	thanks,
	Wahid.
On Fri, Jan 30, 2004 at 06:25:54AM +1100, nauty-list-request at cs.anu.edu.au wrote:
> Send nauty-list mailing list submissions to
> 	nauty-list at cs.anu.edu.au
> 
> To subscribe or unsubscribe via the World Wide Web, visit
> 	http://cs.anu.edu.au/mailman/listinfo/nauty-list
> or, via email, send a message with subject or body 'help' to
> 	nauty-list-request at cs.anu.edu.au
> 
> You can reach the person managing the list at
> 	nauty-list-admin at cs.anu.edu.au
> 
> When replying, please edit your Subject line so it is more specific
> than "Re: Contents of nauty-list digest..."
> 
> 
> Today's Topics:
> 
>    1. isomorphism between 2 graphs (Wahid Chrabakh)
>    2. Re: isomorphism between 2 graphs (Sterten at aol.com)
> 
> --__--__--
> 
> Message: 1
> Date: Wed, 28 Jan 2004 21:39:02 -0800
> From: Wahid Chrabakh <chrabakh at cs.ucsb.edu>
> To: "nauty-list @ cs. anu. edu. au" <nauty-list at cs.anu.edu.au>
> Subject: [Nauty] isomorphism between 2 graphs
> Reply-To: nauty-list at cs.anu.edu.au
> 
> Hi:
> 	I am a new user of nauty. I want to write a small function which will
> 	take as input two graphs and output if the two graphs are isomorphic.
> 	I looked through the documentation but could not figure out how to do
> 	this.
> 	Does such function already exist? Does anyone know of such sample
> 	code? Or can you just give me suggestions where to start?
> 
> 	thanks,
> 	Wahid.
> 
> 
> --__--__--
> 
> Message: 2
> From: Sterten at aol.com
> Date: Thu, 29 Jan 2004 01:06:17 EST
> Subject: Re: [Nauty] isomorphism between 2 graphs
> To: nauty-list at cs.anu.edu.au
> Reply-To: nauty-list at cs.anu.edu.au
> 
> 
> --part1_db.22ddce5.2d49fcd9_boundary
> Content-Type: text/plain; charset="ISO-8859-1"
> Content-Transfer-Encoding: quoted-printable
> 
> In einer eMail vom 29/01/04 6:51:30 AM (MEZ) Mitteleurop=E4ische Zeit schrei=
> bt=20
> chrabakh at cs.ucsb.edu:
> 
> 
> > Hi:
> >     I am a new user of nauty. I want to write a small function which will
> >     take as input two graphs and output if the two graphs are isomorphic.
> >     I looked through the documentation but could not figure out how to do
> >     this.
> >     Does such function already exist? Does anyone know of such sample
> >     code? Or can you just give me suggestions where to start?
> >=20
> >     thanks,
> >     Wahid.
> >=20
> 
> calculate the canonical form of both graphs.
> They are isomorphic, iff the canonical forms coincide.
> I wrote my own routine for this, since I also use a different graph-format=20
> than Nauty,
> but there is also a Nauty-routine "canong".
> 
> Guenter
> 
> --part1_db.22ddce5.2d49fcd9_boundary
> Content-Type: text/html; charset="ISO-8859-1"
> Content-Transfer-Encoding: quoted-printable
> 
> <HTML><FONT FACE=3Darial,helvetica><HTML><FONT  SIZE=3D2 PTSIZE=3D10 FAMILY=
> =3D"SANSSERIF" FACE=3D"Arial" LANG=3D"0">In einer eMail vom 29/01/04 6:51:30=
>  AM (MEZ) Mitteleurop=E4ische Zeit schreibt chrabakh at cs.ucsb.edu:<BR>
> <BR>
> <BR>
> <BLOCKQUOTE TYPE=3DCITE style=3D"BORDER-LEFT: #0000ff 2px solid; MARGIN-LEFT=
> : 5px; MARGIN-RIGHT: 0px; PADDING-LEFT: 5px">Hi:<BR>
> &nbsp;&nbsp;&nbsp; I am a new user of nauty. I want to write a small functio=
> n which will<BR>
> &nbsp;&nbsp;&nbsp; take as input two graphs and output if the two graphs are=
>  isomorphic.<BR>
> &nbsp;&nbsp;&nbsp; I looked through the documentation but could not figure o=
> ut how to do<BR>
> &nbsp;&nbsp;&nbsp; this.<BR>
> &nbsp;&nbsp;&nbsp; Does such function already exist? Does anyone know of suc=
> h sample<BR>
> &nbsp;&nbsp;&nbsp; code? Or can you just give me suggestions where to start?=
> <BR>
> <BR>
> &nbsp;&nbsp;&nbsp; thanks,<BR>
> &nbsp;&nbsp;&nbsp; Wahid.<BR>
> </BLOCKQUOTE><BR>
> <BR>
> calculate the canonical form of both graphs.<BR>
> They are isomorphic, iff the canonical forms coincide.<BR>
> I wrote my own routine for this, since I also use a different graph-format t=
> han Nauty,<BR>
> but there is also a Nauty-routine "canong".<BR>
> <BR>
> Guenter</FONT></HTML>
> 
> --part1_db.22ddce5.2d49fcd9_boundary--
> 
> 
> 
> --__--__--
> 
> _______________________________________________
> This is the nauty mailing list
> Post messages to nauty-list at cs.anu.edu.au
> http://cs.anu.edu.au/~bdm/nauty/
> http://cs.anu.edu.au/mailman/listinfo/nauty-list
> 
> 
> End of nauty-list Digest




More information about the Nauty mailing list