关于共邻域图2

IF 1 Q4 CHEMISTRY, MULTIDISCIPLINARY

Iranian journal of mathematical chemistry Pub Date : 2018-03-01 DOI:10.22052/IJMC.2017.53463.1195

A. Hamzeh, A. Iranmanesh, S. Hossein-Zadeh, M. Hosseinzadeh, I. Gutman

{"title":"关于共邻域图2","authors":"A. Hamzeh, A. Iranmanesh, S. Hossein-Zadeh, M. Hosseinzadeh, I. Gutman","doi":"10.22052/IJMC.2017.53463.1195","DOIUrl":null,"url":null,"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.","PeriodicalId":14545,"journal":{"name":"Iranian journal of mathematical chemistry","volume":null,"pages":null},"PeriodicalIF":1.0000,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On common neighborhood graphs II\",\"authors\":\"A. Hamzeh, A. Iranmanesh, S. Hossein-Zadeh, M. Hosseinzadeh, I. Gutman\",\"doi\":\"10.22052/IJMC.2017.53463.1195\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":14545,\"journal\":{\"name\":\"Iranian journal of mathematical chemistry\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2018-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Iranian journal of mathematical chemistry\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.22052/IJMC.2017.53463.1195\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"CHEMISTRY, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Iranian journal of mathematical chemistry","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.22052/IJMC.2017.53463.1195","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}

引用次数: 0

摘要

设G为顶点集V (G)的简单图。G的共邻图或congraph，记作con(G)，是顶点集V (G)的图，其中两个顶点相邻当且仅当它们在G中至少有一个共邻。我们计算了一些复合图的congraph。利用这些结果，确定了几种特殊图的连接图。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

On common neighborhood graphs II

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Iranian journal of mathematical chemistry CHEMISTRY, MULTIDISCIPLINARY-

CiteScore

2.10

自引率

7.70%

发文量