Results 171 to 180 of about 168,009,036 (204)

From Ultimate Energy to Graph Energies

MATCH – Communications in Mathematical and in Computer Chemistry, 2023
A lower bound is given for the ultimate energy, which is applicable to all graph energies. The extremal characterization is provided for the energy and Laplacian energy when the graph is connected.
Cai, Jin, Zhou, Bo
openaire   +1 more source

A Note on Energy and Sombor Energy of Graphs

MATCH Communications in Mathematical and in Computer Chemistry, 2022
Summary: For a graph \(G\) with \(V(G)=\{v_1,v_2,\dots, v_n\}\) and degree sequence \((d_{v_1},d_{v_2},\dots,d_{v_n})\), the adjacency matrix \(A(G)\) of \(G\) is a \((0,1)\) square matrix of order \(n\) with \(ij\)-th entry \(1\), if \(v_i\) is adjacent to \(v_j\) and \(0\), otherwise.
Rather, Bilal Ahmad, Imran, Muhammad
openaire   +2 more sources

On energy and Laplacian energy of chain graphs

Discrete Applied Mathematics, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kinkar Chandra Das, Abdullah Al-Azemi, Milica Andelic   +2 more
openaire   +2 more sources

Phased graphs and graph energies

Journal of Mathematical Chemistry, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Klein, Douglas J., Rosenfeld, Vladimir R.   +1 more
openaire   +1 more source

On energy and Laplacian energy of bipartite graphs

Applied Mathematics and Computation, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kinkar Chandra Das, Seyed Ahmad Mojallal, Ivan Gutman   +2 more
openaire   +3 more sources

Network Energy: A New Energy of A Graph

2019 IEEE 14th International Conference on Intelligent Systems and Knowledge Engineering (ISKE), 2019
The energy of the graph can be used estimating the altogether $\Pi$-electron energy of the given conjugated hydrocarbons, which was shown as the summation of absolute values of the whole eigenvalue of the adjacency matrix of the graph. We introduce a new energy of a graph in this literature and name it as network energy.
Shengjiu Liu, Tianrui Li 0001, Jie Zhu, Guoqiang Wang, Jia Liu 0033, Peng Xie 0002   +5 more
openaire   +2 more sources

ENERGY COMPACTION FILTERS ON GRAPHS

2018 IEEE Global Conference on Signal and Information Processing (GlobalSIP), 2018
In classical signal processing spectral concentration is an important problem that was first formulated and analyzed by Slepian. The solution to this problem gives the optimal FIR filter that can confine the largest amount of energy in a specific bandwidth for a given filter order. The solution is also known as the prolate sequence.
Teke, Oguzhan, Vaidyanathan, P. P.
openaire   +3 more sources

Maximal Energy Bipartite Graphs

Graphs and Combinatorics, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jack H. Koolen, Vincent Moulton
openaire   +4 more sources

ON THE DISTANCE-DEGREE ENERGY OF GRAPHS

Advances and Applications in Discrete Mathematics, 2022
In this paper, we define the distance-degree energy of a graph which provides the most natural generalization of energy, distance energy and Harary energy. Also, we derive certain properties of the distance-degree energy and investigate its behaviour on certain classes of graphs. Further, we study its relationship with other graph invariants and obtain
Surya, S. Sarah, Subbulakshmi, P.
openaire   +2 more sources

Signless Laplacian energy of a graph and energy of a line graph

Linear Algebra and its Applications, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hilal A. Ganie, Bilal A. Chat, S. Pirzada   +2 more
openaire   +2 more sources