Conjugate Laplacian eigenvalues of co-neighbour graphs
Let \(G\) be a simple graph of order \(n\). A vertex subset is called independent if its elements are pairwise non-adjacent. Two vertices in \(G\) are co-neighbour vertices if they share the same neighbours. Clearly, if \(S\) is a set of pairwise co-neighbour vertices of a graph \(G\), then \(S\) is...
Saved in:
| Date: | 2022 |
|---|---|
| Main Author: | Paul, S. |
| Format: | Article |
| Language: | English |
| Published: |
Lugansk National Taras Shevchenko University
2022
|
| Subjects: | |
| Online Access: | https://admjournal.luguniv.edu.ua/index.php/adm/article/view/1754 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Algebra and Discrete Mathematics |
Institution
Algebra and Discrete MathematicsSimilar Items
-
Conjugate Laplacian eigenvalues of co-neighbour graphs
by: Paul, S.
Published: (2022) -
Co-intersection graph of submodules of a module
by: Mahdavi, Lotf Ali, et al.
Published: (2016) -
Co-intersection graph of submodules of a module
by: Mahdavi, Lotf Ali, et al.
Published: (2016) -
On one-sided interval edge colorings of biregular bipartite graphs
by: Kamalian, Rafayel Ruben
Published: (2015) -
On one-sided interval edge colorings of biregular bipartite graphs
by: Kamalian, Rafayel Ruben
Published: (2015)