On the powers of signed 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.

Shijin T.V.; Germina K.A.; Shahul Hameed K.

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

Journal Paper

Paper Information

Journal: COMMUNICATIONS IN COMBINATORICS AND OPTIMIZATION Year:2022 | Volume:7 | Issue:1 Page(s): 45-51

Download Full-Text

View:

163

Download:

Cites:

Information Journal Paper

Title

On the powers of signed graphs

Author(s)

Shijin T.V. | Germina K.A. | Shahul Hameed K. | Issue Writer Certificate

Keywords

Signed graph

signed distance

distance compatibility

power of signed graphs

Abstract

A Signed graph is an ordered pair = (G; ); where G = (V; E) is the underlying graph of with a signature function : E! f1; 1g. In this article, we de ne the n th power of a Signed graph and discuss some properties of these powers of Signed graphs. As we can de ne two types of Signed graphs as the power of a Signed graph, necessary and su cient conditions are given for an n power of a Signed graph to be unique. Also, we characterize balanced power Signed graphs.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

Shijin, T.V., Germina, K.A., & Shahul Hameed, K.. (2022). On the powers of signed graphs. COMMUNICATIONS IN COMBINATORICS AND OPTIMIZATION, 7(1), 45-51. SID. https://sid.ir/paper/704515/en

Vancouver: Copy

Shijin T.V., Germina K.A., Shahul Hameed K.. On the powers of signed graphs. COMMUNICATIONS IN COMBINATORICS AND OPTIMIZATION[Internet]. 2022;7(1):45-51. Available from: https://sid.ir/paper/704515/en

IEEE: Copy

T.V. Shijin, K.A. Germina, and K. Shahul Hameed, “On the powers of signed graphs,” COMMUNICATIONS IN COMBINATORICS AND OPTIMIZATION, vol. 7, no. 1, pp. 45–51, 2022, [Online]. Available: https://sid.ir/paper/704515/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops