TY - JOUR

T1 - Label incidence energy of partial edge labeled graph

AU - D'Souza, Sabitha

AU - Gowtham, H. J.

AU - Nayak, Swati

AU - Bhat, Pradeep G.

N1 - Publisher Copyright:
© 2021 Jangjeon Research Institute for Mathematical Sciences and Physics. All rights reserved.
Copyright:
Copyright 2021 Elsevier B.V., All rights reserved.

PY - 2021

Y1 - 2021

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85100902898&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85100902898&partnerID=8YFLogxK

U2 - 10.17777/pjms2021.24.1.113

DO - 10.17777/pjms2021.24.1.113

M3 - Article

AN - SCOPUS:85100902898

SN - 1598-7264

VL - 24

SP - 113

EP - 123

JO - Proceedings of the Jangjeon Mathematical Society

JF - Proceedings of the Jangjeon Mathematical Society

IS - 1

ER -