Abstract
Let G = (V,E) be a simple graph with vertex set V = {ν1, ν2, ⋯, νn} and edge set E = {e1, e2, ⋯, em}. The label incidence matrix Bι(G) of G is the n × m matrix whose (i, j)-entry is a if 0 labeled edge incident to 0 labeled vertex, 6 if 1 labeled edge incident to 1 labeled vertex, c if unlabeled edge incident to 0 or 1 labeled vertex and 0 otherwise. The label incidence energy IEι(G) is the sum of the singular values of Bι(G). In this paper we give lower and upper bounds for IEι(G) in terms of graph parameters and we study label incidence energy of some families of graph.
| Original language | English |
|---|---|
| Pages (from-to) | 113-123 |
| Number of pages | 11 |
| Journal | Proceedings of the Jangjeon Mathematical Society |
| Volume | 24 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 2021 |
All Science Journal Classification (ASJC) codes
- General Mathematics
Fingerprint
Dive into the research topics of 'Label incidence energy of partial edge labeled graph'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver