On the structure of compact graphs

A simple graph \(G\) is called a compact graph if \(G\) contains no isolated vertices and for each pair \(x\), \(y\) of non-adjacent vertices of \(G\), there is a vertex \(z\) with \(N(x)\cup N(y)\subseteq N(z)\), where \(N(v)\) is the neighborhood of \(v\), for every vertex \(v\) of \(G\). In this...

Full description

Bibliographic Details
Main Authors: Reza Nikandish, Farzad Shaveisi
Format: Article
Language:English
Published: AGH Univeristy of Science and Technology Press 2017-01-01
Series:Opuscula Mathematica
Subjects:
Online Access:http://www.opuscula.agh.edu.pl/vol37/6/art/opuscula_math_3747.pdf

Similar Items