On the Aα-spectral radii of cactus graphs

© 2020 by the authors. Let A(G) be the adjacent matrix and D(G) the diagonal matrix of the degrees of a graph G, respectively. For 0 ≤ α ≤ 1, the Aα-matrix is the general adjacency and signless Laplacian spectral matrix having the form of Aα(G) = αD(G) + (1-α)A(G). Clearly, A0(G) is the adjacent matrix and 2A1/2 is the signless Laplacian matrix. A cactus is a connected graph such that any two of its cycles have at most one common vertex, that is an extension of the tree. The Aα-spectral radius of a cactus graph with n vertices and k cycles is explored. The outcomes obtained in this paper can imply some previous bounds from trees to cacti. In addition, the corresponding extremal graphs are determined. Furthermore, we proposed all eigenvalues of such extremal cacti. Our results extended and enriched previous known results

ON THE ROOTS OF EDGE COVER POLYNOMIALS OF GRAPHS

AbstractLet G be a simple graph of order n and size m. An edge covering of the graph G is a set of edges such that every vertex of the graph is incident to at least one edge of the set. Let e(G,k) be the number of edge covering sets of G of size k. The edge cover polynomial of G is the polynomial E(G,x)=∑k=1me(G,k)xk. In this paper, we obtain some results on the roots of the edge cover polynomials. We show that for every graph G with no isolated vertex, all the roots of E(G,x) are in the ball {z∈C:|z|<(2+3)21+3≃5.099}. We prove that if every block of the graph G is K2 or a cycle, then all real roots of E(G,x) are in the interval (−4,0]. We also show that for every tree T of order n we have ξR(K1,n−1)≤ξR(T)≤ξR(Pn), where −ξR(T) is the smallest real root of E(T,x), and Pn,K1,n−1 are the path and the star of order n, respectively

Csoportok és reprezentációik = Groups and their representations

Változatos kérdéseket vizsgáltunk a csoportelméletben, a csoportok reprezentációelméletében és más kapcsolódó absztrakt algebrai területeken. 39 tudományos dolgozatot publikáltunk, ezek nagy részét vezető nemzetközi folyóiratokban (pl. Bulletin of the London Mathematical Society, Duke Mathematical Journal, European Journal of Combinatorics, Journal of Algebra, Journal of Group Theory, Proceedings of the American Mathematical Society). Legfontosabb eredményeink a következők: Meghatároztuk a pozitiv karakterisztikájú globális testek feletti aritmetikai csoportok kongruenciarészcsoport-növekedését. Új példákat találtunk olyan csoportokra, amelyeknek izomorf a pro-véges lezárásuk. Teljes leirását adtuk azoknak a moduláris csoportalgebráknak, melyek Lie nilpotencia-indexe maximális. Csoportelméleti módszereket alkalmazva a loopok elméletében olyan (128 elemű) loopot konstruáltunk, amelynél a belső permutációk csoportja kommutativ és a loop nilpotnecia osztálya 3, ezzel Bruck egy 60 éves kérdésére adtunk választ. Az univerzális algebrában a véges moduláris hálók egy széles osztályára konstruáltunk véges kongruencia-reprezentációkat, mégpedig operátorcsoportok felhasználásával. A bonyolultságelméletben több algebrai problémát tanulmányoztunk. Például megmutattuk, hogy nem feloldható csoportokban az azonosságok ellenőrzése NP-teljes probléma. | We studied various questions in group theory, in representation theory of groups, and in related areas of abstract algebra. We published 39 research papers, many of them in leading international journals (for example, Bulletin of the London Mathematical Society, Duke Mathematical Journal, European Journal of Combinatorics, Journal of Algebra, Journal of Group Theory, Proceedings of the American Mathematical Society). The most important results are the following: We determined the congruence subgroup growth of arithmetic groups over global fields of positive characteristic. We found new examples of groups with isomorphic pro-finite closure. We gave a complete description of modular group algebras with maximal Lie nilpotency index. Applying group theoretic methods in loop theory, we constructed an example of a loop (of order 128) with an Abelian inner permutation group and of nilpotency class 3, thereby answering a 60-year old question of Bruck. In universal algebra we constructed finite congruence lattice representations for a large class of finite modular lattices, namely by using operator groups. In complexity theory we studied several algebraic problems. For example, we showed that for nonsolvable groups the checking of identities is an NP-complete problem

Graph homomorphisms between trees

In this paper we study several problems concerning the number of homomorphisms of trees. We give an algorithm for the number of homomorphisms from a tree to any graph by the Transfer-matrix method. By using this algorithm and some transformations on trees, we study various extremal problems about the number of homomorphisms of trees. These applications include a far reaching generalization of Bollob\'as and Tyomkyn's result concerning the number of walks in trees. Some other highlights of the paper are the following. Denote by $\hom(H,G)$ the number of homomorphisms from a graph $H$ to a graph $G$. For any tree $T_m$ on $m$ vertices we give a general lower bound for $\hom(T_m,G)$ by certain entropies of Markov chains defined on the graph $G$. As a particular case, we show that for any graph $G$, $$\exp(H_{\lambda}(G))\lambda^{m-1}\leq\hom(T_m,G),$$ where $\lambda$ is the largest eigenvalue of the adjacency matrix of $G$ and $H_{\lambda}(G)$ is a certain constant depending only on $G$ which we call the spectral entropy of $G$. In the particular case when $G$ is the path $P_n$ on $n$ vertices, we prove that $$\hom(P_m,P_n)\leq \hom(T_m,P_n)\leq \hom(S_m,P_n),$$ where $T_m$ is any tree on $m$ vertices, and $P_m$ and $S_m$ denote the path and star on $m$ vertices, respectively. We also show that if $T_m$ is any fixed tree and $$\hom(T_m,P_n)>\hom(T_m,T_n),$$ for some tree $T_n$ on $n$ vertices, then $T_n$ must be the tree obtained from a path $P_{n-1}$ by attaching a pendant vertex to the second vertex of $P_{n-1}$. All the results together enable us to show that |\End(P_m)|\leq|\End(T_m)|\leq|\End(S_m)|, where \End(T_m) is the set of all endomorphisms of $T_m$ (homomorphisms from $T_m$ to itself).Comment: 47 pages, 15 figure

Graph Energies of Egocentric Networks and Their Correlation with Vertex Centrality Measures

Graph energy is the energy of the matrix representation of the graph, where the energy of a matrix is the sum of singular values of the matrix. Depending on the definition of a matrix, one can contemplate graph energy, Randi\'c energy, Laplacian energy, distance energy, and many others. Although theoretical properties of various graph energies have been investigated in the past in the areas of mathematics, chemistry, physics, or graph theory, these explorations have been limited to relatively small graphs representing chemical compounds or theoretical graph classes with strictly defined properties. In this paper we investigate the usefulness of the concept of graph energy in the context of large, complex networks. We show that when graph energies are applied to local egocentric networks, the values of these energies correlate strongly with vertex centrality measures. In particular, for some generative network models graph energies tend to correlate strongly with the betweenness and the eigencentrality of vertices. As the exact computation of these centrality measures is expensive and requires global processing of a network, our research opens the possibility of devising efficient algorithms for the estimation of these centrality measures based only on local information

Syntheses, crystal structures and magnetic properties of complexes based on [Ni(L-L)3]2+ complex cations with dimethylderivatives of 2, 2'-bipyridine and TCNQ

From the aqueous-methanolic systems Ni(NO3)2 – LiTCNQ – 5, 5'-dmbpy and Ni(NO3)2 – LiTCNQ – 4, 4'-dmbpy three novel complexes [Ni(5, 5'-dmbpy)3](TCNQ)2 (1), [Ni(4, 4'-dmbpy)3](TCNQ)2 (2) and [Ni(4, 4'-dmbpy)3]2(TCNQ-TCNQ)(TCNQ)2·0.60H2O (3), were isolated in single crystal form. The new compounds were identified using chemical analyses and IR spectroscopy. Single crystal studies of all samples corroborated their compositions and have shown that their ionic structures contain the complex cations [Ni(5, 5'-dmbpy)]2+ (1) or [Ni(4, 4'-dmbpy)]2+ (2 and 3). The anionic parts of the respective crystal structures 1–3 are formed by TCNQ·- anion-radicals and in 3 also by a s-dimerized dianion (TCNQ-TCNQ)2- with a C-C distance of 1.663(5) Å. The supramolecular structures are governed by weak hydrogen bonding interactions. The variable-temperature (2–300 K) magnetic studies of 1 and 3 confirmed the presence of magnetically active Ni(II) atoms with S = 1 and TCNQ·- anion-radicals with S = 1/2 while the (TCNQ-TCNQ)2- dianion is magnetically silent. The magnetic behavior was described by a complex magnetic model assuming strong antiferromagnetic interactions between some TCNQ·- anion-radicals