On the common-neighborhood energy of a graph (Q2853216)
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 6217170
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the common-neighborhood energy of a graph |
scientific article; zbMATH DE number 6217170 |
Statements
18 October 2013
0 references
graph spectra
0 references
graph energy
0 references
common neighborhood
0 references
strongly regular graphs
0 references
0.9841714
0 references
0 references
0 references
0 references
0 references
0.8960606
0 references
0 references
On the common-neighborhood energy of a graph (English)
0 references
The common-neighborhood matrix \(\mathrm{CN}\) of a graph \(G\) displays at position \((i,j)\) the number of common neighbors for vertices \(i\) and \(j\). The common-neighborhood energy \(E_{\mathrm{CN}}\) of \(G\) is equal to the sum of absolute values of eigenvalues of CN. The authors obtain an upper bound for \(E_{\mathrm{CN}}\) when \(G\) is strongly regular. It is also shown that \(E_{\mathrm{CN}}\) of several classes of graphs is less than the common-neighborhood energy of the complete graph \(K_n\).
0 references
