On the two-sided group digraph with a normal adjacency matrix

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.

Nowroozi Larki Farzaneh; Rayat Pisheh Shahram

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: Journal of Discrete Mathematics and its Applications Year:2024 | Volume:9 | Issue:2 Page(s): 103-111

Download Full-Text

View:

Download:

Cites:

Information Journal Paper

Title

On the two-sided group digraph with a normal adjacency matrix

Author(s)

Nowroozi Larki Farzaneh | Rayat Pisheh Shahram | Issue Writer Certificate

Keywords

Cayley digraph

adjacency matrix

Normal Matrix

Abstract

This article explores the adjacency matrix of a two-sided group graph andits properties. We introduce the two-sided color group digraph to generalize the Cayley color graph and the two-sided group digraph. We alsoobtain the adjacency matrix of the latter digraph and provide a criterion fordetermining the normality of the adjacency matrix of a two-sided group graph.Moreover, we prove that if all the two-sided group digraphs of valency two fora certain group G are normal, then G is a Hamiltonian group. We also showthat if a strongly connected two-sided group digraph of valency two is normal,the corresponding group is isomorphic to the product of two groups: a cyclicgroup with either Tk,n or Hp,q, or an abelian group.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans