Different Neighbourhoods via Ideals on Graphs
In this paper, we generate different approximations for j∈r,l,r,l,u,i,u,i by using the concept of ideal, Nj-neighbourhoods and Pj-neighbourhoods from vertices of a graph. Then, we compare these approximations with the previous one, and we see that these approximations are more accurate. Finally, we...
Saved in:
| Main Author: | A. Çaksu Güler |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2022-01-01
|
| Series: | Journal of Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2022/9925564 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
On the neighbourhood degree sum-based Laplacian energy of graphs
Published: (2025-01-01) -
Zero Divisor Graph of a Lattice and Its Unique Ideal
by: Rajendra Deore, et al.
Published: (2019-01-01) -
From the Village to the Neighbourhood
by: Toni García
Published: (2021-11-01) -
A Neighbourhood Semantics for the Logic TK
by: Cezar A. Mortari, et al.
Published: (2011-05-01) -
On the 2-absorbing ideals and zero divisor graph of equivalence classes op zero divisors
by: Sh. Payrovi, et al.
Published: (2014-06-01)