Energy of Bipartite graphs generated by Hankel sequences

H. S. Sujatha

doi:10.69793/ijmcs/04.2025/sujatha

Energy of Bipartite graphs generated by Hankel sequences

H. S. Sujatha^*

^*Corresponding author for this work

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

Abstract

The Hankel matrix corresponding to the sequence (a₁, a₂, …, a_2n−1) is a matrix of order n. This matrix is graphical only when a₁ = a₃ = a₅ = … = a_2n−1 = 0 and a₂, a₄, a₆, …a_2n−2 is either 0 or 1. The phrase “Hankel graph”refers to such a graph. The Hankel graphs so generated are the bipartite graphs. In this paper, the energy bound for bipartite graphs generated by some Hankel sequences has been determined.

Original language	English
Pages (from-to)	1109-1112
Number of pages	4
Journal	International Journal of Mathematics and Computer Science
Volume	20
Issue number	4
DOIs	https://doi.org/10.69793/ijmcs/04.2025/sujatha
Publication status	Published - 01-2025

All Science Journal Classification (ASJC) codes

Computer Science (miscellaneous)
Algebra and Number Theory
Statistics and Probability
Numerical Analysis
Modelling and Simulation
Discrete Mathematics and Combinatorics
Computational Mathematics
Applied Mathematics

Access to Document

10.69793/ijmcs/04.2025/sujatha

Cite this

@article{5820a1cfbbde44a4acd4c60ede332439,

title = "Energy of Bipartite graphs generated by Hankel sequences",

abstract = "The Hankel matrix corresponding to the sequence (a1, a2, …, a2n−1) is a matrix of order n. This matrix is graphical only when a1 = a3 = a5 = … = a2n−1 = 0 and a2, a4, a6, …a2n−2 is either 0 or 1. The phrase “Hankel graph”refers to such a graph. The Hankel graphs so generated are the bipartite graphs. In this paper, the energy bound for bipartite graphs generated by some Hankel sequences has been determined.",

author = "Sujatha, \{H. S.\}",

year = "2025",

month = jan,

doi = "10.69793/ijmcs/04.2025/sujatha",

language = "English",

volume = "20",

pages = "1109--1112",

journal = "International Journal of Mathematics and Computer Science",

issn = "1814-0424",

publisher = "Badih/Ghusayni, Ed. \& Pub.",

number = "4",

}

TY - JOUR

T1 - Energy of Bipartite graphs generated by Hankel sequences

AU - Sujatha, H. S.

PY - 2025/1

Y1 - 2025/1

N2 - The Hankel matrix corresponding to the sequence (a1, a2, …, a2n−1) is a matrix of order n. This matrix is graphical only when a1 = a3 = a5 = … = a2n−1 = 0 and a2, a4, a6, …a2n−2 is either 0 or 1. The phrase “Hankel graph”refers to such a graph. The Hankel graphs so generated are the bipartite graphs. In this paper, the energy bound for bipartite graphs generated by some Hankel sequences has been determined.

AB - The Hankel matrix corresponding to the sequence (a1, a2, …, a2n−1) is a matrix of order n. This matrix is graphical only when a1 = a3 = a5 = … = a2n−1 = 0 and a2, a4, a6, …a2n−2 is either 0 or 1. The phrase “Hankel graph”refers to such a graph. The Hankel graphs so generated are the bipartite graphs. In this paper, the energy bound for bipartite graphs generated by some Hankel sequences has been determined.

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

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

U2 - 10.69793/ijmcs/04.2025/sujatha

DO - 10.69793/ijmcs/04.2025/sujatha

M3 - Article

AN - SCOPUS:105024674843

SN - 1814-0424

VL - 20

SP - 1109

EP - 1112

JO - International Journal of Mathematics and Computer Science

JF - International Journal of Mathematics and Computer Science

IS - 4

ER -

Energy of Bipartite graphs generated by Hankel sequences

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this