article · Online Journal of Analytic Combinatorics · 2019

The block energy of a graph

B. Sharada, Mohammad Issa Sowaity, A. M. Naji

Cited by 0Open access

Abstract

In this paper, we introduce the concept block matrix (B-matrix) of a graph \( G \), and obtain some coefficients of the characteristic polynomial \( \phi(G, \mu) \) of the B-matrix of \( G \). The block energy \( E_B(G) \) is established. Further upper and lower bounds for \( E_B(G) \) are obtained. In addition, we define a uni-block graph. Some properties and new bounds for the block energy of the uni-block graph are presented.

Cite this paper

APA 7

Sharada, B., Sowaity, M. I., & Naji, A. M. (2019). The block energy of a graph. Online Journal of Analytic Combinatorics, 1–13. https://doi.org/10.61091/ojac-1402

MLA 9

Sharada, B., et al. “The block energy of a graph.” Online Journal of Analytic Combinatorics, no. 14, 2019, pp. 1–13, https://doi.org/10.61091/ojac-1402.

Chicago

Sharada, B., Mohammad Issa Sowaity, and A. M. Naji. 2019. “The block energy of a graph.” Online Journal of Analytic Combinatorics: 1–13. https://doi.org/10.61091/ojac-1402.

Harvard

Sharada, B., Sowaity, M.I. and Naji, A.M. (2019) ‘The block energy of a graph’, Online Journal of Analytic Combinatorics, pp. 1–13. Available at: https://doi.org/10.61091/ojac-1402.

BibTeX

@article{sharada2019block,
  title = {{The block energy of a graph}},
  author = {Sharada, B. and Sowaity, Mohammad Issa and Naji, A. M.},
  journal = {Online Journal of Analytic Combinatorics},
  number = {14},
  pages = {1--13},
  year = {2019},
  doi = {10.61091/ojac-1402}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.