bio | website | |
---|---|---|
location | Esfahan, Iran | |
age | ||
visits | member for | 1 year, 2 months |
seen | Jan 8 at 5:39 | |
stats | profile views | 33 |
Mojtaba Jazaeri PhD student Department of Mathematics University of Isfahan
Nov 25 |
comment |
Paley graphs over $p^{2}$ vertices
I have faced some problems to construct cospectral non-isomorphic graph with $P(p^{2})$ from the thesis for large prime number $p$. would you please giving me some more explanation. |
Nov 24 |
awarded | Citizen Patrol |
Nov 24 |
awarded | Supporter |
Nov 24 |
accepted | Paley graphs over $p^{2}$ vertices |
Nov 24 |
comment |
Paley graphs over $p^{2}$ vertices
I think that in the mentioned thesis it is proved that Paley graph and Dickson semifield graph are cospectral non-isomorphic graphs but the order of proper semifield, i.e. a finite semifield which is not a field, must be $p^{n}$, where $p$ is a prime number, $n$ is an integer greater than 2 and $p^{n}$ is greater than 8. Therefore i think that this result does not imply my result. Is it true? |
Nov 24 |
asked | Paley graphs over $p^{2}$ vertices |
Feb 24 |
awarded | Scholar |
Feb 24 |
accepted | The number of specific structure |
Feb 24 |
awarded | Editor |
Feb 24 |
revised |
The number of specific structure
added 12 characters in body |
Feb 23 |
revised |
The number of specific structure
edited tags |
Feb 23 |
comment |
The number of specific structure
Thank you every one who answer to this question. |
Feb 23 |
asked | The number of specific structure |
Feb 9 |
comment |
The number of non-isomorphic strongly regular graphs on n vertices
As we know, every strongly regular graph over prime number of vertices is a conference graph and Paley graph is a conference graph and the following sentence due to Willem H. HAEMERS: For v = 5, 9, 13 and 17, the Paley graph is the only one with the given parameters. If $v \geq 25$, other graphs with the same parameters exist. in the following paper: Matrices for graphs, designs and codes Why this sentence is true? if this sentence is true, then there are at least 2 non-isomorphic strongly regular graphs on prime number of vertices $p>25$. |
Feb 6 |
awarded | Student |
Feb 5 |
comment |
The number of non-isomorphic strongly regular graphs on n vertices
Thank you very much Professor Chris Godsil and professor Aaron Meyerowitz. |
Feb 5 |
revised |
The number of non-isomorphic strongly regular graphs on n vertices
edited tags |
Feb 5 |
comment |
The number of non-isomorphic strongly regular graphs on n vertices
Thank you for every one who answer to the question. |
Feb 5 |
asked | The number of non-isomorphic strongly regular graphs on n vertices |