Some results on neighbourhood highly irregular graphs. (Q2881273)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6021496
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some results on neighbourhood highly irregular graphs. |
scientific article; zbMATH DE number 6021496 |
Statements
3 April 2012
0 references
irregular graph
0 references
highly irregular graph
0 references
neighborhood highly irregular graph
0 references
0 references
0 references
0.91161776
0 references
0 references
0 references
0.89068615
0 references
0 references
0.88395554
0 references
Some results on neighbourhood highly irregular graphs. (English)
0 references
A connected simple graph \(G = (V,E)\) is said to be a neighborhood highly irregular graph if for any vertex \(v \in V\), any two distinct vertices in the open neighborhood of \(v\) have distinct closed neighborhood sets. The main result of the paper is as follows: The smallest order of a neighborhood highly irregular graph with clique number \(n\) is \(n + \left \lceil \log _2 n \right \rceil \).
0 references
