AUTOMORPHISM GROUPS OF SOME NON-TRANSITIVE GRAPHS

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

GHOLAMI AHMAD

Educational Videos and Scientific Workshops

Scientific Information Database

ISSN: 2588-4824

Journal Paper

Paper Information

Journal: Iranian Journal of Mathematical Sciences and Informatics Year:2007 | Volume:2 | Issue:1 Page(s): 47-54

Download Full-Text

View:

315

Download:

133

Cites:

Information Journal Paper

Title

AUTOMORPHISM GROUPS OF SOME NON-TRANSITIVE GRAPHS

Author(s)

GHOLAMI AHMAD | Issue Writer Certificate

Keywords

WEIGHTED GRAPH

EUCLIDEAN GRAPH

AUTOMORPHISM GROUP

Abstract

An EUCLIDEAN GRAPH associated with a molecule is defined by a WEIGHTED GRAPH with adjacency matrix M = [dij], where for ij, dij is the Euclidean distance between the nuclei i and j. In this matrix dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce different weights for distinct nuclei. Balaban introduced some monster graphs and then Randic computed complexity indices of them (1973, 2001). In this paper, with a simple method, we calculate the AUTOMORPHISM GROUP of some WEIGHTED GRAPHs.

Cites

No record.

References

No record.

Cite

APA: Copy

GHOLAMI, AHMAD. (2007). AUTOMORPHISM GROUPS OF SOME NON-TRANSITIVE GRAPHS. IRANIAN JOURNAL OF MATHEMATICAL SCIENCES AND INFORMATICS (IJMSI), 2(1), 47-54. SID. https://sid.ir/paper/310305/en

Vancouver: Copy

GHOLAMI AHMAD. AUTOMORPHISM GROUPS OF SOME NON-TRANSITIVE GRAPHS. IRANIAN JOURNAL OF MATHEMATICAL SCIENCES AND INFORMATICS (IJMSI)[Internet]. 2007;2(1):47-54. Available from: https://sid.ir/paper/310305/en

IEEE: Copy

AHMAD GHOLAMI, “AUTOMORPHISM GROUPS OF SOME NON-TRANSITIVE GRAPHS,” IRANIAN JOURNAL OF MATHEMATICAL SCIENCES AND INFORMATICS (IJMSI), vol. 2, no. 1, pp. 47–54, 2007, [Online]. Available: https://sid.ir/paper/310305/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops

Download

Move to top

وبگردی