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...
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
-
On the hat problem on a graph
by: Marcin Krzywkowski
Published: (2012-01-01) -
Some remarks on the sum of powers of the degrees of graphs
by: Emina Milovanovic, et al.
Published: (2021-03-01) -
Relating graph energy with vertex-degree-based energies
by: Ivan Gutman
Published: (2020-10-01) -
On the chromatic number of graphs with some restriction of vertex degrees
by: S.N. Selezneva
Published: (2020-12-01) -
On Graph Structures in Fuzzy Environment Using Optimization Parameter
by: Atiq Ur Rehman, et al.
Published: (2021-01-01)