novel inequalities for generalized graph entropies graph energies and topological indices the entropy of a graph is an information theoretic quantity for measuring the complexity of a graph after shannon introduced the entropy to information and communication many generalizations of the entropy measure have been proposed such as renyi entropy and daroczy entropy in this article we prove accurate connections inequalities between generalized graph entropies graph energies and topological indices additionally we obtain some extremal properties of nine generalized graph entropies by employing graph energies and topological indices

spectra of digraphs in this primarily expository paper we survey classical and some more recent results on the spectra of digraphs equivalently the spectra of 0 1 matrices with emphasis on the spectral radius

energy of line graphs the energy of a graph is equal to the sum of the absolute values of its eigenvalues the energy of a matrix is equal to the sum of its singular values we establish relations between the energy of the line graph of a graph g and the energies associated with the laplacian and signless laplacian matrices of g

trees with minimal laplacian coefficients let g be a simple undirected graph with the characteristic polynomial of its laplacian matrix l g p g m email protected k 0 n 1 kc email protected n k it is well known that for trees the laplacian coefficient c n 2 is equal to the wiener index of g while c n 3 is equal to the modified hyper wiener index of the graph in this paper we characterize n vertex trees with given matching number m which simultaneously minimize all laplacian coefficients the extremal tree a n m is a spur obtained from the star graph s n m 1 with n m 1 vertices by attaching a pendant edge to each of certain m 1 non central vertices of s n m 1 in particular a n m minimizes the wiener index the modified hyper wiener index and the recently introduced incidence energy of trees defined as ie g email protected k 0 email protected k where m k are the eigenvalues of signless laplacian matrix q g d g a g we introduced a general r transformation which decreases all laplacian coefficients simultaneously in conclusion we illustrate on examples of wiener index and incidence energy that the opposite problem of simultaneously maximizing all laplacian coefficients has no solution

analyzing lattice networks through substructures abstract analyzing the topology of network structures is an important topic studied from many different aspects of science and mathematics the wiener polarity index number of unordered pairs of vertices at distance 3 from each other is one of the representative descriptors of graph structures it was computed for several lattice networks by chen et al 11 in an effort to understand the properties of these networks the wiener polarity index is a variation of the classic distance based graph invariant the wiener index sum of distances between all pairs of vertices which is known to be closely related to the number of substructures in this paper we examine the numbers of various subgraphs of order 4 for these lattice networks in addition to confirming their symmetric nature comparing the numbers of various substructures leads to insights on other less trivial characteristics of these network structures of common interest

global exponential stability of almost periodic solution of delayed neural networks with discontinuous activations in this paper we study the existence uniqueness and stability of almost periodic solution for the class of delayed neural networks the neural network considered in this paper employs the activation functions which are discontinuous monotone increasing and possibly unbounded under a new sufficient condition we prove that the neural network has a unique almost periodic solution which is globally exponentially stable moreover the obtained conclusion is applied to prove the existence and stability of periodic solution or equilibrium point for delayed neural networks with periodic coefficients or constant coefficients we also give some illustrative numerical examples to show the effectiveness of our results

the skew energy of random oriented graphs abstract given a graph g let g be an oriented graph of g with the orientation and skew adjacency matrix s g the skew energy of the oriented graph g denoted by e s g is defined as the sum of the absolute values of all the eigenvalues of s g in this paper we study the skew energy of random oriented graphs and formulate an exact estimate of the skew energy for almost all oriented graphs by generalizing wigner s semicircle law moreover we consider the skew energy of random regular oriented graphs g n d and get an exact estimate of the skew energy for almost all regular oriented graphs

global convergence of neural networks with mixed time varying delays and discontinuous neuron activations in this paper we investigate the dynamical behavior of a class of delayed neural networks with discontinuous neuron activations and general mixed time delays involving both time varying delays and distributed delays due to the presence of time varying delays and distributed delays the step by step construction of local solutions cannot be applied this difficulty can be overcome by constructing a sequence of solutions to delayed dynamical systems with high slope activations and show that this sequence converges to a desired filippov solution of the discontinuous delayed neural networks we then derive two sets of sufficient conditions for the global exponential stability and convergence of the neural networks in terms of linear matrix inequalities lmis and m matrix properties equivalently some diagonally dominant conditions respectively convergence behavior of both the neuron state and the neuron output are discussed the obtained results extend previous work on global stability of delayed neural networks with lipschitz continuous neuron activations and neural networks with discontinuous neuron activations and only constant delays

on the laplacian coefficients of tricyclic graphs abstract let g d e t i n l g k 0 n 1 k c k n k be the characteristic polynomial of the laplacian matrix of a graph g of order n in this paper we show that among all connected tricyclic graphs of order n the k th coefficient c k is smallest when the graph is b n 7 1 3 3 3 obtained from the complete graph k 4 by adding n 4 pendent vertices attached to the vertex of degree 3 and for some lemmas in c x he h y shan on the laplacian coefficients of bicyclic graphs discrete math 310 2010 3404 3412 we present a new method to prove them

weakly closed unipotent subgroups in chevalley groups abstract the goal of this note is to classify the weakly closed unipotent subgroups in the split chevalley groups in an application we show under some mild assumptions on the characteristic that the lie algebra of a connected simple algebraic group fails to be a so called 2f module

the laplacian incidence energy of graphs abstract the laplacian incidence energy of a graph is defined as the sum of the singular values of its normalized oriented incidence matrix in this paper we give sharp upper and lower bounds as well as the coulson integral formula for the laplacian incidence energy moreover we show a close relation of the laplacian incidence energy normalized incidence energy and randic energy

a novel method for analyzing inverse problem of topological indices of graphs using competitive agglomeration a novel method for analyzing the inverse problem of topological indices of graph is proposed in this paper which applies the data mining technique to classification of graphs according to topological indices differing from the way of using topological indices to categorize graphs into different isomorphic classes this method aims at dividing molecular graphs with n vertices into several compact classes according to their topological indices then the chemical and physical features of each kind of graph can be researched and new compounds can be found which has great significance on bio medical filed in the experiment three classes of simple connected graphs with 5 6 and 7 vertices respectively are investigated and analyzed using the proposed method the experimental results show the validity of it however there are still some problems needed to be researched further such as selecting the vector of topological indices for clustering selecting the distance between the vectors of topological indices choosing the aspects to analyze the properties of each kind of graph after clustering etc

asymptotic energy of lattices abstract the energy of a simple graph g arising in chemical physics denoted by e g is defined as the sum of the absolute values of eigenvalues of g as the dimer problem and spanning trees problem in statistical physics in this paper we propose the energy per vertex problem for lattice systems in general for a type of lattice in statistical physics to compute the entropy constant with toroidal cylindrical mobius band klein bottle and free boundary conditions are different tasks with different hardness and may have different solutions we show that the energy per vertex of plane lattices is independent of the toroidal cylindrical mobius band klein bottle and free boundary conditions in particular the asymptotic formulae of energies of the triangular 3 3 4 2 and hexagonal lattices with toroidal cylindrical mobius band klein bottle and free boundary conditions are obtained explicitly

all hypoenergetic graphs with maximum degree at most 3 abstract the energy e g of a graph g is defined as the sum of the absolute values of its eigenvalues a connected graph g of order n is said to be hypoenergetic if e g n all connected hypoenergetic graphs with maximum degree 3 have been characterized in addition to the four earlier known hypoenergetic trees we now show that complete bipartite graph k 2 3 is the only hypoenergetic cycle containing hypoenergetic graph by this the validity of a conjecture by majstorovic et al has been confirmed

overgroup lattices in finite groups of lie type containing a parabolic the main theorem is a step in a program to show there exist finite lattices that are not an interval in the lattice of subgroups of any finite group as part of the proof of the main theorem we prove a theorem on the structure of maximal parabolics in finite groups of lie type which is of independent interest

almost periodic dynamics of a class of delayed neural networks with discontinuous activations we use the concept of the filippov solution to study the dynamics of a class of delayed dynamical systems with discontinuous right hand side which contains the widely studied delayed neural network models with almost periodic self inhibitions interconnection weights and external inputs we prove that diagonal dominant conditions can guarantee the existence and uniqueness of an almost periodic solution as well as its global exponential stability as special cases we derive a series of results on the dynamics of delayed dynamical systems with discontinuous activations and periodic coefficients or constant coefficients respectively from the proof of the existence and uniqueness of the solution we prove that the solution of a delayed dynamical system with high slope activations approximates to the filippov solution of the dynamical system with discontinuous activations

on products and line graphs of signed graphs their eigenvalues and energy abstract in this article we examine the adjacency and laplacian matrices and their eigenvalues and energies of the general product non complete extended p sum or neps of signed graphs we express the adjacency matrix of the product in terms of the kronecker matrix product and the eigenvalues and energy of the product in terms of those of the factor graphs for the cartesian product we characterize balance and compute expressions for the laplacian eigenvalues and laplacian energy we give exact results for those signed planar cylindrical and toroidal grids which are cartesian products of signed paths and cycles we also treat the eigenvalues and energy of the line graphs of signed graphs and the laplacian eigenvalues and laplacian energy in the regular case with application to the line graphs of signed grids that are cartesian products and to the line graphs of all positive and all negative complete graphs

on the energy of 0 1 matrices the energy of a matrix is the sum of its singular values we study the energy of 0 1 matrices and present two methods for constructing balanced incomplete block designs whose incidence matrices have the maximum possible energy amongst the family of all 0 1 matrices of given order and total number of ones we also find a new upper bound for the energy of p q bipartite graphs

the influence of miroslav fiedler on spectral graph theory abstract this note is a write up of a talk given at the ilas meeting in braunschweig 2011 at the minisymposium celebrating the 80th birthday of miroslav fiedler the purpose of the talk is to outline the impact of fiedler s work on the development of spectral graph theory fiedler is best known for putting forward the algebraic connectivity and its eigenvector these two topics were genuine gold strikes which have motivated thousands of studies in pure and applied science but there is more in fiedler s work that influences spectral graph theory and still more waiting to be discovered

beyond graph energy norms of graphs and matrices abstract in 1978 gutman introduced the energy of a graph as the sum of the absolute values of graph eigenvalues and ever since then graph energy has been intensively studied since graph energy is the trace norm of the adjacency matrix matrix norms provide a natural background for its study thus this paper surveys research on matrix norms that aims to expand and advance the study of graph energy the focus is exclusively on the ky fan and the schatten norms both generalizing and enriching the trace norm as it turns out the study of extremal properties of these norms leads to numerous analytic problems with deep roots in combinatorics the survey brings to the fore the exceptional role of hadamard matrices conference matrices and conference graphs in matrix norms in addition a vast new matrix class is studied a relaxation of symmetric hadamard matrices the survey presents solutions to just a fraction of a larger body of similar problems bonding analysis to combinatorics thus open problems and questions are raised to outline topics for further investigation

subgroups of lie type groups containing a unipotent radical abstract in this paper we show that if g is a lie type group and r a proper subgroup of g containing some unipotent radical then r has a nilpotent normal subgroup generated by long root subgroups and r is contained in a proper parabolic subgroup of g we also obtain some consequences of this result

complete reducibility of quadratic modules for finite lie type groups let g be a finite lie type group in char p 3 different from sl2 3 and v a zpg module on which the root groups of g act quadratically i e v ar ar 0 for all roots of the root system of g then we show that v is completely reducible

on the energy of some circulant graphs we give an explicit construction of circulant graphs of very high energy this construction is based on gauss sums we also show the littlewood conjecture can be used to establish new result for a certain class of circulant graphs

the laplacian energy and laplacian estrada index of random multipartite graphs abstract let g be a simple graph on n vertices and m edges and 1 2 n be the eigenvalues of the laplacian matrix of g the laplacian energy of g is defined as e l g i 1 n i 2 m n and the laplacian estrada index of g is defined as l e e g i 1 n e i 2 m n in this paper we establish asymptotic lower and upper bounds to the laplacian energy and laplacian estrada index respectively for random multipartite graphs

groups of lie type generated by long root elements in f4 k abstract let k be a field and g a quasi simple subgroup of the chevalley group f4 k we assume that g is generated by a class of abstract root subgroups such that there are a c with a c and any a is contained in a long root subgroup of f4 k we determine the possibilities for g and describe the embedding of g in f4 k

energy matching number and odd cycles of graphs abstract the energy e g of a graph g is the sum of the absolute values of the eigenvalues of the adjacency matrix of g wong et al 2018 11 proved that e g 2 g where g denotes the matching number of g we settle the equality case that was left open from that paper we also show that for connected graphs without perfect matching e g 2 g 1 except for complete bipartite graphs of the form k r r 1 further for graphs with vertex disjoint cycles we prove that e g 2 g c o g where c o g denotes the number of odd cycles of g with length at least 5 this improves another result of wong et al

lower bounds for the energy of digraphs abstract the energy of a digraph d is defined as e d i 1 n re z i where z 1 z n are the eigenvalues of d in this article we find lower bounds for the energy of digraphs in terms of the number of closed walks of length 2 extending in this way the result obtained by caporossi et al g caporossi d cvetkovic i gutman p hansen variable neighborhood search for extremal graphs 2 finding graphs with extremal energy j chem inf comput sci 39 1999 984 996 2 m e g for all graphs g with m edges also we study digraphs with three eigenvalues

graphs and matrices with maximal energy abstract given a complex m n matrix a we index its singular values as 1 a 2 a and call the value e a 1 a 2 a the energy of a thereby extending the concept of graph energy introduced by gutman koolen and moulton proved that e g n 2 1 n for any graph g of order n and exhibited an infinite family of graphs with e g v g 2 1 v g we prove that for all sufficiently large n there exists a graph g g n with e g n 3 2 2 n 11 10 this implies a conjecture of koolen and moulton we also characterize all square nonnegative matrices and all graphs with energy close to the maximal one in particular such graphs are quasi random

the energy of a graph abstract the energy e g of a simple graph g is defined to be the sum of the absolute values of the eigen values of g if g is a k regular graph on n vertices then e g k k n 1 n k b 2 and this bound is sharp it is shown that for each 0 there exist infinitely many n for each of which there exists a k regular graph g of order n with k e g b 2 two graphs with the same number of vertices are equienergetic if they have the same energy we show that for any positive integer n 3 there exist two equienergetic graphs of order 4n that are not cospectral

on the laplacian coefficients of unicyclic graphs abstract let g be a graph of order n and let p g k 0 n 1 k c k n k be the characteristic polynomial of its laplacian matrix generalizing an approach of mohar on graph transformations we show that among all connected unicyclic graphs of order n the k th coefficient c k is largest when the graph is a cycle c n and smallest when the graph is the a s n with an additional edge between two of its pendent vertices a relation to the recently established laplacian like energy of a graph is discussed

remarks on hyperenergetic circulant graphs we first settle an open problem of balakrishnan from linear algebra appl 387 2004 287 295 further if ci n k1 k2 km n n k1 k2 km n 2 ki n for i 1 2 m denotes a circulant graph with the vertex set v 0 1 n 1 such that a vertex u is adjacent to all vertices of v u except u ki mod n i 1 2 m w e show that for any given k1 k2 km almost all circulant graphs ci n k1 k2 km are hyperenergetic

lower bounds of nikiforov s energy over digraphs abstract the energy of a graph g is defined as e g i 1 n i where 1 2 n are the eigenvalues of the adjacency matrix of g this concept was extended by nikiforov 8 to digraphs as n d i 1 n i where d is a digraph with n vertices and singular values 1 n upper bounds of n were found by kharaghani and tayfeh rezaie 4 in this work we find lower bounds of n over the set of digraphs

generalized lyapunov approach for convergence of neural networks with discontinuous or non lipschitz activations the paper considers a class of additive neural networks where the neuron activations are modeled by discontinuous functions or by continuous non lipschitz functions some tools are developed which enable us to apply a lyapunov like approach to differential equations with discontinuous right hand side modeling the neural network dynamics the tools include a chain rule for computing the time derivative along the neural network solutions of a nondifferentiable lyapunov function and a comparison principle for this time derivative which yields conditions for exponential convergence or convergence in finite time by means of the lyapunov like approach a general result is proved on global exponential convergence toward a unique equilibrium point of the neural network solutions moreover new results on global convergence in finite time are established which are applicable to neuron activations with jump discontinuities or neuron activations modeled by means of continuous non lipschitz holder functions

energy of matrices abstract let m n c denote the space of n n matrices with entries in c we define the energy of a m n c as 1 e a k 1 n k t r a n where 1 n are the eigenvalues of a tr a is the trace of a and z denotes the modulus of z c if a is the adjacency matrix of a graph g then e a is precisely the energy of the graph g introduced by gutman in 1978 in this paper we compare the energy e with other well known energies defined over matrices then we find upper and lower bounds of e which extend well known results for the energies of graphs and digraphs also we obtain new results on energies defined over the adjacency laplacian and signless laplacian matrices of digraphs

the energy of graphs and matrices abstract given a complex m n matrix a we index its singular values as 1 a 2 a and call the value e a 1 a 2 a the energy of a thereby extending the concept of graph energy introduced by gutman let 2 m n a be an m n nonnegative matrix with maximum entry and a 1 n extending previous results of koolen and moulton for graphs we prove that e a a 1 m n m 1 a 2 2 a 1 2 m n n m m 2 furthermore if a is any nonconstant matrix then e a 1 a a 2 2 1 2 a 2 a finally we note that wigner s semicircle law implies that e g 4 3 o 1 n 3 2 for almost all graphs g

asymptotic laplacian energy like invariant of lattices let 1 2 n denote the laplacian eigenvalues of a graph g with n vertices the laplacian energy like invariant denoted by lel g i 1 n 1 i is a novel topological index in this paper we show that the laplacian energy like per vertex of various lattices is independent of the toroidal cylindrical and free boundary conditions simultaneously the explicit asymptotic values of the laplacian energy like in these lattices are obtained moreover our approach implies that in general the laplacian energy like per vertex of other lattices is independent of the boundary conditions

remarks on the energy of regular graphs abstract the energy of a graph is the sum of the absolute values of the eigenvalues of its adjacency matrix this note is about the energy of regular graphs it is shown that graphs that are close to regular can be made regular with a negligible change of the energy also a k regular graph can be extended to a k regular graph of a slightly larger order with almost the same energy as an application it is shown that for every sufficiently large n there exists a regular graph g of order n whose energy g satisfies g 1 2 n 3 2 n 13 10 several infinite families of graphs with maximal or submaximal energy are given and the energy of almost all regular graphs is determined

dissipativity and synchronization of generalized bam neural networks with multivariate discontinuous activations this paper is concerned with the dissipativity and synchronization problems of a class of delayed bidirectional associative memory bam neural networks in which neuron activations are modeled by discontinuous bivariate functions first the concept of the filippov solution is extended to functional differential equations with discontinuous right hand sides and mixed delays via functional differential inclusions the global dissipativity of the filippov solution to the considered bam neural networks is proven using generalized halanay inequalities and matrix measure approaches second to realize global exponential complete synchronization of bam neural networks with multivariate discontinuous activations discontinuous state feedback controllers are designed using functional differential inclusions theory and nonsmooth analysis theory with generalized lyapunov functional method finally several numerical examples are provided to demonstrate the applicability and effectiveness of our proposed results

a lower bound for the spectral radius of a digraph abstract we show that the spectral radius d of a digraph d with n vertices and c 2 closed walks of length 2 satisfies d c 2 n moreover equality occurs if and only if d is the symmetric digraph associated to a c 2 n regular graph plus some arcs that do not belong to cycles as an application of this result we construct new sharp upper bounds for the low energy of a digraph which extends koolen and moulton bounds of the energy to digraphs

some properties of graphs constructed from 2 designs abstract let d p b be any nontrivial nonsymmetric 2 v k design in this paper we construct a connected regular and bipartite graph say ig v b d from d some graphic properties of ig v b d are investigated in particular the results in the paper bridges the equivalency between edge transitivity of ig v b d and flag transitivity of d with the equivalency it is obtained that ig v b d is a semisymmetric graph as long as d is a nonsymmetric flag transitive 2 v k design

extrema of graph eigenvalues abstract in 1993 hong asked what are the best bounds on the k th largest eigenvalue k g of a graph g of order n this challenging question has never been tackled for any 2 k n in the present paper tight bounds are obtained for all k 2 and even tighter bounds are obtained for the k th largest singular value k g some of these bounds are based on taylor s strongly regular graphs and others on a method of kharaghani for constructing hadamard matrices the same kind of constructions are applied to other open problems like nordhaus gaddum problems of the kind how large can k g k g be these constructions are successful also in another open question how large can the ky fan norm 1 g k g be ky fan norms of graphs generalize the concept of graph energy so this question generalizes the problem for maximum energy graphs in the final section several results and problems are restated for 1 1 matrices which seem to provide a more natural ground for such research than graphs many of the results in the paper are paired with open questions and problems for further study