• Home
  • Browse
    • Current Issue
    • By Issue
    • By Author
    • By Subject
    • Author Index
    • Keyword Index
  • Journal Info
    • About Journal
    • Aims and Scope
    • Editorial Board
    • Publication Ethics
    • Indexing and Abstracting
    • Related Links
    • FAQ
    • Peer Review Process
    • News
  • Guide for Authors
  • Submit Manuscript
  • Reviewers
  • Contact Us
 
  • Login
  • Register
Home Articles List Article Information
  • Save Records
  • |
  • Printable Version
  • |
  • Recommend
  • |
  • How to cite Export to
    RIS EndNote BibTeX APA MLA Harvard Vancouver
  • |
  • Share Share
    CiteULike Mendeley Facebook Google LinkedIn Twitter
Iranian Journal of Mathematical Chemistry
arrow Articles in Press
arrow Current Issue
Journal Archive
Volume Volume 10 (2019)
Volume Volume 9 (2018)
Issue Issue 4
Issue Issue 3
Issue Issue 2
Issue Issue 1
Volume Volume 8 (2017)
Volume Volume 7 (2016)
Volume Volume 6 (2015)
Volume Volume 5 (2014)
Volume Volume 4 (2013)
Volume Volume 3 (2012)
Volume Volume 2 (2011)
Volume Volume 1 (2010)
Hamzeh, A., Iranmanesh, A., Hossein-Zadeh, S., Hosseinzadeh, M., Gutman, I. (2018). On common neighborhood graphs II. Iranian Journal of Mathematical Chemistry, 9(1), 37-46. doi: 10.22052/ijmc.2017.53463.1195
A. Hamzeh; A. Iranmanesh; S. Hossein-Zadeh; M. A. Hosseinzadeh; I. Gutman. "On common neighborhood graphs II". Iranian Journal of Mathematical Chemistry, 9, 1, 2018, 37-46. doi: 10.22052/ijmc.2017.53463.1195
Hamzeh, A., Iranmanesh, A., Hossein-Zadeh, S., Hosseinzadeh, M., Gutman, I. (2018). 'On common neighborhood graphs II', Iranian Journal of Mathematical Chemistry, 9(1), pp. 37-46. doi: 10.22052/ijmc.2017.53463.1195
Hamzeh, A., Iranmanesh, A., Hossein-Zadeh, S., Hosseinzadeh, M., Gutman, I. On common neighborhood graphs II. Iranian Journal of Mathematical Chemistry, 2018; 9(1): 37-46. doi: 10.22052/ijmc.2017.53463.1195

On common neighborhood graphs II

Article 11, Volume 9, Issue 1, Winter 2018, Page 37-46  XML PDF (314.77 K)
Document Type: Research Paper
DOI: 10.22052/ijmc.2017.53463.1195
Authors
A. Hamzeh1; A. Iranmanesh email 1; S. Hossein-Zadeh1; M. A. Hosseinzadeh1; I. Gutman2
1Tarbiat Modares University
2University of Kragujevac
Abstract
Let G be a simple graph with vertex set V (G). The common neighborhood graph or
congraph of G, denoted by con(G), is a graph with vertex set V (G), in which two vertices
are adjacent if and only if they have at least one common neighbor in G. We compute the
congraphs of some composite graphs. Using these results, the congraphs of several special
graphs are determined.
Keywords
Common neighborhood graph; congraph; Mycielski graph; shadow graph; Haj´os join
Main Subjects
Chemical Graph Theory
Statistics
Article View: 280
PDF Download: 337
Home | Glossary | News | Aims and Scope | Sitemap
Top Top

Creative Commons
Journal Management System. Designed by sinaweb.