COMMON NEIGHBORHOOD GRAPH

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.

HOSSEIN ZADEH S.; IRANMANESH A.; HAMZEH A.; HOSSEINZADEH M.A.

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

Journal Paper

Paper Information

Journal: JOURNAL OF NEW RESEARCHES IN MATHEMATICS Year:2016 | Volume:2 | Issue:5 Page(s): 71-80

Download Full-Text

Persian Verion

View:

1,439

Download:

Cites:

Information Journal Paper

Title

COMMON NEIGHBORHOOD GRAPH

Author(s)

HOSSEIN ZADEH S. | IRANMANESH A. | HAMZEH A. | HOSSEINZADEH M.A. | Issue Writer Certificate

Keywords

COMMON NEIGHBORHOOD GRAPHQ1

HAMILTONIAN CYCLEQ1

CLIQUE NUMBERQ1

GRAPH OPERATIONQ1

Abstract

Let G be a simple graph with vertex set {n1, n2, … , nn}. The COMMON NEIGHBORHOOD GRAPH of G, denoted by con (G), is a graph with vertex set {n1, n2, … , nn}, in which two vertices are adjacent if and only if they have at least one common neighbor in the graph G. In this paper, we compute the common neighborhood of some composite graphs. In continue, we investigate the relation between hamiltonicity of graph G and con (G). Also, we obtain a lower bound for the CLIQUE NUMBER of con (G) in terms of CLIQUE NUMBER of graph G. Finally we state that the total chromatic number of G is bounded by chromatic number of con (T(G)).

Cites

No record.

References

No record.

Cite

APA: Copy

HOSSEIN ZADEH, S., IRANMANESH, A., HAMZEH, A., & HOSSEINZADEH, M.A.. (2016). COMMON NEIGHBORHOOD GRAPH. JOURNAL OF NEW RESEARCHES IN MATHEMATICS, 2(5), 71-80. SID. https://sid.ir/paper/257235/en

Vancouver: Copy

HOSSEIN ZADEH S., IRANMANESH A., HAMZEH A., HOSSEINZADEH M.A.. COMMON NEIGHBORHOOD GRAPH. JOURNAL OF NEW RESEARCHES IN MATHEMATICS[Internet]. 2016;2(5):71-80. Available from: https://sid.ir/paper/257235/en

IEEE: Copy

S. HOSSEIN ZADEH, A. IRANMANESH, A. HAMZEH, and M.A. HOSSEINZADEH, “COMMON NEIGHBORHOOD GRAPH,” JOURNAL OF NEW RESEARCHES IN MATHEMATICS, vol. 2, no. 5, pp. 71–80, 2016, [Online]. Available: https://sid.ir/paper/257235/en

Related Journal Papers