BOUNDS FOR ENERGY OF BINARY LABELED GRAPH

Sabitha D’souza; H. J. Gowtham; Pradeep G. Bhat

BOUNDS FOR ENERGY OF BINARY LABELED GRAPH

Sabitha D’souza
, H. J. Gowtham^*
, Pradeep G. Bhat

^*Corresponding author for this work

Manipal Institute of Technology, Manipal

Research output: Contribution to journal › Article › peer-review

Abstract

Let G be a graph with vertex set V (G) and edge set X(G) and consider the set A = {0, 1}. A mapping l: V (G) → A is called binary vertex labeling of G and l(v) is called the label of the vertex v under l. The label energy of G is the sum of the absolute values of the label eigenvalues. In this paper, we establish bounds for label energy, largest label eigenvalue and label spectral radius.

Original language	English
Pages (from-to)	113-121
Number of pages	9
Journal	Global and Stochastic Analysis
Volume	10
Issue number	2
Publication status	Published - 12-2023

All Science Journal Classification (ASJC) codes

Statistics and Probability
Discrete Mathematics and Combinatorics

Cite this

@article{c83c52399dcd42f0adae817cf1f9bfb9,

title = "BOUNDS FOR ENERGY OF BINARY LABELED GRAPH",

abstract = "Let G be a graph with vertex set V (G) and edge set X(G) and consider the set A = \{0, 1\}. A mapping l: V (G) → A is called binary vertex labeling of G and l(v) is called the label of the vertex v under l. The label energy of G is the sum of the absolute values of the label eigenvalues. In this paper, we establish bounds for label energy, largest label eigenvalue and label spectral radius.",

author = "Sabitha D{\textquoteright}souza and Gowtham, \{H. J.\} and Bhat, \{Pradeep G.\}",

year = "2023",

month = dec,

language = "English",

volume = "10",

pages = "113--121",

journal = "Global and Stochastic Analysis",

issn = "2248-9444",

publisher = "MUK Publications and Distribution",

number = "2",

}

TY - JOUR

T1 - BOUNDS FOR ENERGY OF BINARY LABELED GRAPH

AU - D’souza, Sabitha

AU - Gowtham, H. J.

AU - Bhat, Pradeep G.

PY - 2023/12

Y1 - 2023/12

N2 - Let G be a graph with vertex set V (G) and edge set X(G) and consider the set A = {0, 1}. A mapping l: V (G) → A is called binary vertex labeling of G and l(v) is called the label of the vertex v under l. The label energy of G is the sum of the absolute values of the label eigenvalues. In this paper, we establish bounds for label energy, largest label eigenvalue and label spectral radius.

AB - Let G be a graph with vertex set V (G) and edge set X(G) and consider the set A = {0, 1}. A mapping l: V (G) → A is called binary vertex labeling of G and l(v) is called the label of the vertex v under l. The label energy of G is the sum of the absolute values of the label eigenvalues. In this paper, we establish bounds for label energy, largest label eigenvalue and label spectral radius.

UR - https://www.scopus.com/pages/publications/85169012943

UR - https://www.scopus.com/pages/publications/85169012943#tab=citedBy

M3 - Article

AN - SCOPUS:85169012943

SN - 2248-9444

VL - 10

SP - 113

EP - 121

JO - Global and Stochastic Analysis

JF - Global and Stochastic Analysis

IS - 2

ER -

BOUNDS FOR ENERGY OF BINARY LABELED GRAPH

Abstract

All Science Journal Classification (ASJC) codes

Other files and links

Fingerprint

Cite this