59 results on '"Adjacency matrix"'
Search Results
2. Minimum ev-Dominating Energy of Semigraph.
- Author
-
Nath, Niva Rani, Nath, Surajit Kumar, Nandi, Ardhendu Kumar, and Nath, Biswajit
- Subjects
- *
ABSOLUTE value , *LAPLACIAN matrices , *EIGENVALUES , *DOMINATING set - Abstract
This paper established the idea of minimum evdominating matrix of semigraph and calculated its energy. The minimum ev-dominating energy EmeD(G) of a semigraph G is the sum of the absolute values of the eigenvalues of the minimum ev-dominating matrix. Here some results are also derived in connection with the energy of minimum evdominating matrix. Some lower bounds are also established. [ABSTRACT FROM AUTHOR]
- Published
- 2024
3. ON GRAPHS WITH ANTI-RECIPROCAL EIGENVALUE PROPERTY.
- Author
-
AKHTER, SADIA, AHMAD, UZMA, and HAMEED, SAIRA
- Subjects
- *
EIGENVALUES , *REGULAR graphs , *UNDIRECTED graphs , *GRAPH connectivity - Abstract
Let A(G) be the adjacency matrix of a simple connected undirected graph G. A graph G of order n is said to be non-singular (respectively singular) if A(G) is non-singular (respectively singular). The spectrum of a graph G is the set of all its eigenvalues denoted by spec(G). The antireciprocal (respectively reciprocal) eigenvalue property for a graph G can be defined as "Let G be a non-singular graph G if the negative reciprocal (respectively positive reciprocal) of each eigenvalue is likewise an eigenvalue of G, then G has anti-reciprocal (respectively reciprocal) eigenvalue property." Furthermore, a graph G is said to have strong anti-reciprocal eigenvalue property (resp. strong reciprocal eigenvalue property) if the eigenvalues and their negative (resp. positive) reciprocals are of same multiplicities. In this article, graphs satisfying anti-reciprocal eigenvalue (or property (-R)) and strong anti-reciprocal eigenvalue property (or property (-SR)) are discussed. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
4. The General Extended Adjacency Eigenvalues of Chain Graphs.
- Author
-
Rather, Bilal Ahmad, Ganie, Hilal A., Das, Kinkar Chandra, and Shang, Yilun
- Subjects
- *
EIGENVALUES , *TRACE formulas , *REGULAR graphs , *MOLECULAR connectivity index - Abstract
In this article, we discuss the spectral properties of the general extended adjacency matrix for chain graphs. In particular, we discuss the eigenvalues of the general extended adjacency matrix of the chain graphs and obtain its general extended adjacency inertia. We obtain bounds for the largest and the smallest general extended adjacency eigenvalues and characterize the extremal graphs. We also obtain a lower bound for the spread of the general extended adjacency matrix. We characterize chain graphs with all the general extended adjacency eigenvalues being simple and chain graphs that are non-singular under the general extended adjacency matrix. Further, we determine the explicit formula for the determinant and the trace of the square of the general extended adjacency matrix of chain graphs. Finally, we discuss the energy of the general extended adjacency matrix and obtain some bounds for it. We characterize the extremal chain graphs attaining these bounds. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
5. ON THE SPREAD OF THE GENERALIZED ADJACENCY MATRIX OF A GRAPH.
- Author
-
BAGHIPUR, M., GHORBANI, M., GANIE, H. A., and PIRZADA, S.
- Subjects
- *
GRAPH connectivity , *MATRICES (Mathematics) , *EIGENVALUES , *LAPLACIAN matrices - Abstract
Let D(G) and A(G), respectively, be the diagonal matrix of vertex de- grees and the adjacency matrix of a connected graph G. The generalized adjacency matrix of G is defined as Aα(G) = αD(G) + (1 − α)A(G), α ∈ [0, 1]. The spread of the generalized adjacency matrix, denoted by S(Aα(G)), is defined as the difference of the largest and smallest eigenvalues of Aα(G). The spread S(Q(G)) of Q(G), the signless Laplacian matrix of G and S(A(G)) of A(G) are similarly defined. In this paper, we establish the relationships between S(Aα(G)), S(Q(G)) and S(A(G)). Further, we find bounds for S(Aα(G)) involving different parameters of G. Also, we obtain lower bounds for S(Aα(G)) in terms of the clique number and independence number of G, and we characterize the extremal graphs in some cases. [ABSTRACT FROM AUTHOR]
- Published
- 2023
6. Spectral Characterization of Graphs with Respect to the Anti-Reciprocal Eigenvalue Property.
- Author
-
Guan, Hao, Khan, Aysha, Akhter, Sadia, and Hameed, Saira
- Subjects
- *
EIGENVALUES , *GRAPH connectivity - Abstract
Let G = (V , E) be a simple connected graph with vertex set V and edge set E, respectively. The term "anti-reciprocal eigenvalue property" refers to a non-singular graph G for which, − 1 λ ∈ σ (G) , whenever λ ∈ σ (G) , ∀ λ ∈ σ (G) . Here, σ (G) is the multiset of all eigenvalues of A (G) . Moreover, if multiplicities of eigenvalues and their negative reciprocals are equal, then that graph is said to have strong anti-reciprocal eigenvalue properties, and the graph is referred to as a strong anti-reciprocal graph (or (− S R) graph). In this article, a new family of graphs F n (k , j) is introduced and the energy of F 5 (k , k 2) k ≥ 2 is calculated. Furthermore, with the help of F 5 (k , k 2) , some families of (− S R) graphs are constructed. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
7. Some New Bounds for α -Adjacency Energy of Graphs.
- Author
-
Zhang, Haixia and Zhang, Zhuolin
- Subjects
- *
GRAPH theory , *EIGENVALUES , *STRUCTURAL analysis (Engineering) , *ENERGY consumption - Abstract
Let G be a graph with the adjacency matrix A (G) , and let D (G) be the diagonal matrix of the degrees of G. Nikiforov first defined the matrix A α (G) as A α (G) = α D (G) + (1 − α) A (G) , 0 ≤ α ≤ 1 , which shed new light on A (G) and Q (G) = D (G) + A (G) , and yielded some surprises. The α − adjacency energy E A α (G) of G is a new invariant that is calculated from the eigenvalues of A α (G) . In this work, by combining matrix theory and the graph structure properties, we provide some upper and lower bounds for E A α (G) in terms of graph parameters (the order n, the edge size m, etc.) and characterize the corresponding extremal graphs. In addition, we obtain some relations between E A α (G) and other energies such as the energy E (G) . Some results can be applied to appropriately estimate the α -adjacency energy using some given graph parameters rather than by performing some tedious calculations. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
8. On weighted noncorona graphs with properties R and -SR.
- Author
-
Ahmad, Uzma, Hameed, Saira, and Akhter, Sadia
- Subjects
- *
EIGENVALUES , *WEIGHTED graphs - Abstract
Let Gw be a simple weighted graph with adjacency matrix A(Gw). The set of all eigenvalues of A(Gw) is called the spectrum of weighted graph Gw denoted by σ(Gw). The reciprocal eigenvalue property (or property R) for a connected weighted nonsingular graph Gw is defined as, if η ∈ σ(Gw) then 1 η ∈ σ(Gw). Further, if η and 1 η have the same multiplicities for each η ∈ σ(Gw) then this graph is said to have strong reciprocal eigenvalue property (or property SR). Similarly, a connected weighted nonsingular graph Gw is said to have anti-reciprocal eigenvalue property (or property -R) if η ∈ σ(Gw) then - 1 η ∈ σ(Gw). Furthermore, if η and - 1 η have the same multiplicities for each η ∈ σ(Gw) then strong anti-reciprocal eigenvalue property (or property -SR) holds for the weighted graph Gw. In this article, classes of weighted noncorona graphs satisfying property R and property -SR are studied. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
9. Inverse Sum Indeg Index (Energy) with Applications to Anticancer Drugs.
- Author
-
Altassan, Alaa, Rather, Bilal Ahmad, and Imran, Muhammad
- Subjects
- *
ANTINEOPLASTIC agents , *ABSOLUTE value , *STATISTICAL models , *EIGENVALUES , *MOLECULAR connectivity index - Abstract
For a simple graph with vertex set { v 1 , v 2 , ... , v n } with degree sequence d v i of vertex v i , i = 1 , 2 , ... , n , the inverse sum indeg matrix ( I S I -matrix) A I S I (G) = (a i j) n × n of G is defined by a i j = d v i d v j d v i + d v j , if v i is adjacent to v j , and zero, otherwise. The multiset of eigenvalues of A I S I (G) is the I S I -spectrum of G and the sum of their absolute values is the I S I -energy of G . In this paper, we modify the two results of (Li, Ye and Broersma, 2022), give the correct characterization of the extremal graphs and thereby obtain better bounds than the already known results. Moreover, we also discuss the QSPR analysis and carry the statistical modelling (linear, logarithmic and quadratic) of the physicochemical properties of anticancer drugs with the I S I -index (energy). [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
10. The Singularity of Four Kinds of Tricyclic Graphs.
- Author
-
Ma, Haicheng, Gao, Shang, and Zhang, Bin
- Subjects
- *
MOLECULAR graphs , *EIGENVALUES , *MATHEMATICS , *CHEMISTS , *RANDOM graphs - Abstract
A singular graph G, defined when its adjacency matrix is singular, has important applications in mathematics, natural sciences and engineering. The chemical importance of singular graphs lies in the fact that if the molecular graph is singular, the nullity (the number of the zero eigenvalue) is greater than 0, then the corresponding chemical compound is highly reactive or unstable. By this reasoning, chemists have a great interest in this problem. Thus, the problem of characterization singular graphs was proposed and raised extensive studies on this challenging problem thereafter. The graph obtained by conglutinating the starting vertices of three paths P s 1 , P s 2 , P s 3 into a vertex, and three end vertices into a vertex on the cycle C a 1 , C a 2 , C a 3 , respectively, is denoted as γ (a 1 , a 2 , a 3 , s 1 , s 2 , s 3) . Note that δ (a 1 , a 2 , a 3 , s 1 , s 2) = γ (a 1 , a 2 , a 3 , s 1 , 1 , s 2) , ζ (a 1 , a 2 , a 3 , s) = γ (a 1 , a 2 , a 3 , 1 , 1 , s) , φ (a 1 , a 2 , a 3) = γ (a 1 , a 2 , a 3 , 1 , 1 , 1) . In this paper, we give the necessity and sufficiency that the γ − graph, δ − graph, ζ − graph and φ − graph are singular and prove that the probability that a randomly given γ − graph, δ − graph, ζ − graph or φ − graph being singular is equal to 325 512 , 165 256 , 43 64 , 21 32 , respectively. From our main results, we can conclude that such a γ − graph( δ − graph, ζ − graph, φ − graph) is singular if at least one cycle is a multiple of 4 in length, and surprisingly, the theoretical probability of these graphs being singular is more than half. This result promotes the understanding of a singular graph and may be promising to propel the solutions to relevant application problems. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
11. MORE ON SIGNED GRAPHS WITH AT MOST THREE EIGENVALUES.
- Author
-
RAMEZANI, FARZANEH, ROWLINSON, PETER, and STANIĆ, ZORAN
- Subjects
- *
EIGENVALUES , *SYMMETRIC matrices , *SUBGRAPHS , *CHARTS, diagrams, etc. , *REGULAR graphs - Abstract
We consider signed graphs with just 2 or 3 distinct eigenvalues, in particular (i) those with at least one simple eigenvalue, and (ii) those with vertex-deleted subgraphs which themselves have at most 3 distinct eigenvalues. We also construct new examples using weighing matrices and symmetric 3-class association schemes. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
12. A γ Eigenvalues of Zero Divisor Graph of Integer Modulo and Von Neumann Regular Rings.
- Author
-
Rather, Bilal Ahmad, Ali, Fawad, Ullah, Asad, Fatima, Nahid, and Dad, Rahim
- Subjects
- *
EIGENVALUES , *DIVISOR theory , *RINGS of integers , *LAPLACIAN matrices , *SPECTRAL theory , *INTEGERS , *MATRICES (Mathematics) - Abstract
The A γ matrix of a graph G is determined by A γ (G) = (1 − γ) A (G) + γ D (G) , where 0 ≤ γ ≤ 1 , A (G) and D (G) are the adjacency and the diagonal matrices of node degrees, respectively. In this case, the A γ matrix brings together the spectral theories of the adjacency, the Laplacian, and the signless Laplacian matrices, and many more γ adjacency-type matrices. In this paper, we obtain the A γ eigenvalues of zero divisor graphs of the integer modulo rings and the von Neumann rings. These results generalize the earlier published spectral theories of the adjacency, the Laplacian and the signless Laplacian matrices of zero divisor graphs. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
13. New Results on the Minimum Edge Dominating Energy of a Graph.
- Author
-
Movahedi, F. and Akhbari, M. H.
- Subjects
- *
FIXED point theory , *MATHEMATICS , *GRAPHIC methods , *EIGENVALUES , *MATRIX inequalities - Abstract
Let G be a graph with n vertices and m edges. The minimum edge dominating energy is defined as the sum of the absolute values of eigenvalues of the minimum edge dominating matrix of the graph G. In this paper, some lower and upper bounds for the minimum edge dominating energy of graph G are established. [ABSTRACT FROM AUTHOR]
- Published
- 2022
14. Star complements in signed graphs with two symmetric eigenvalues.
- Author
-
Stanić, Zoran
- Subjects
- *
EIGENVALUES , *CHARTS, diagrams, etc. , *REGULAR graphs - Abstract
We consider signed graphs Ġ whose spectra are comprised of exactly two (distinct) eigenvalues that differ only in sign, abbreviated to signed graphs with two symmetric eigenvalues. We obtain some relationships between such signed graphs and their star complements. Our results include structural examinations and constructions of infinite families of signed graphs with two symmetric eigenvalues. We also determine the bases for the eigenspaces of the eigenvalues of Ġ in terms of the eigenspaces of its star complement. In particular, we consider the case in which a star complement has two symmetric eigenvalues, as well. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
15. Two upper bounds on the Aα-spectral radius of a connected graph.
- Author
-
Pirzada, Shariefuddin
- Subjects
- *
GRAPH theory , *GEOMETRIC vertices , *EIGENVALUES , *SUBGRAPHS , *GENERALIZATION - Abstract
If A(G) and D(G) are respectively the adjacency matrix and the diagonal matrix of vertex degrees of a connected graph G, the generalized adjacency matrix Aα(G) is defined as Aα(G) = α D(G) + (1 - α) A(G), where 0 ≤ α ≤ 1. The Aα (or generalized) spectral radius λ(Aα(G)) (or simply λα) is the largest eigenvalue of Aα(G). In this paper, we show that λα ≤ α Δ + (1 - α)√ 2m ( 1 - 1/ω), where m, Δ and ω = ω(G) are respectively the size, the largest degree and the clique number of G. Further, if G has order n, then we show that ... where di and mi are respectively the degree and the average 2-degree of the vertex Vi. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
16. Change of nullity of a graph under two operations.
- Author
-
Mohiaddin, Gohdar H. and Sharaf, Khidir R.
- Subjects
- *
INDEPENDENT variables , *GRAPH theory , *EIGENVALUES , *MULTIPLICITY (Mathematics) - Abstract
The nullity of a graph G is the multiplicity of zero as an eigenvalue of its adjacency matrix. An assignment of weights to the vertices of a graph, that satisfies a zero sum condition over the neighbors of each vertex, and uses maximum number of independent variables is denoted by a high zero sum weighting of the graph. This applicable tool is used to determine the nullity of the graph. Two types of graphs are defined, and the change of their nullities is studied, namely, the graph G+ab constructed from G by adding a new vertex ab which is joint to all neighbors of both vertices a and b of G, and G•ab which is obtained from G+ab by removing both vertices a and b. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
17. ON THE α-SPECTRAL RADIUS OF GRAPHS.
- Author
-
Haiyan Guo and Bo Zhou
- Subjects
- *
RADIUS (Geometry) , *EIGENVALUES , *DOMINATING set , *MATRICES (Mathematics) , *DIAMETER , *TREES - Abstract
For 0 ≤ α ≤ 1, Nikiforov proposed to study the spectral properties of the family of matrices Aα(G) = αD(G)+(1 - α)A(G) of a graph G, where D(G) is the degree diagonal matrix and A(G) is the adjacency matrix of G. The α-spectral radius of G is the largest eigenvalue of Aα(G). For a graph with two pendant paths at a vertex or at two adjacent vertices, we prove results concerning the behavior of the α-spectral radius under relocation of a pendant edge in a pendant path. We give upper bounds for the α-spectral radius for unicyclic graphs G with maximum degree ∆ ≥ 2, connected irregular graphs with given maximum degree and some other graph parameters, and graphs with given domination number, respectively. We determine the unique tree with the second largest α-spectral radius among trees, and the unique tree with the largest α-spectral radius among trees with given diameter. We also determine the unique graphs so that the difference between the maximum degree and the α-spectral radius is maximum among trees, unicyclic graphs and non-bipartite graphs, respectively. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
18. ON REGULAR SIGNED GRAPHS WITH THREE EIGENVALUES.
- Author
-
ANĐELIĆ, MILICA, KOLEDIN, TAMARA, and STANIĆ, ZORAN
- Subjects
- *
REGULAR graphs , *EIGENVALUES , *ELECTRONIC information resource searching - Abstract
In this paper our focus is on regular signed graphs with exactly 3 (distinct) eigenvalues. We establish certain basic results; for example, we show that they are walk-regular. We also give some constructions and determine all the signed graphs with 3 eigenvalues, under the constraint that they are either signed line graphs or have vertex degree 3. We also report our result of computer search on those with at most 10 vertices. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
19. SOME OBSERVATIONS ON THE SMALLEST ADJACENCY EIGENVALUE OF A GRAPH.
- Author
-
CIOABĂ, SEBASTIAN M., ELZINGA, RANDALL J., and GREGORY, DAVID A.
- Subjects
- *
RAYLEIGH quotient , *SUBGRAPHS , *EIGENVALUES - Abstract
In this paper, we discuss various connections between the smallest eigenvalue of the adjacency matrix of a graph and its structure. There are several techniques for obtaining upper bounds on the smallest eigenvalue, and some of them are based on Rayleigh quotients, Cauchy interlacing using induced subgraphs, and Haemers interlacing with vertex partitions and quotient matrices. In this paper, we are interested in obtaining lower bounds for the smallest eigenvalue. Motivated by results on line graphs and generalized line graphs, we show how graph decompositions can be used to obtain such lower bounds. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
20. The role of the anti-regular graph in the spectral analysis of threshold graphs.
- Author
-
Aguilar, Cesar O., Ficarra, Matthew, Schurman, Natalie, and Sullivan, Brittany
- Subjects
- *
EIGENVALUES - Abstract
The purpose of this paper is to highlight the role played by the anti-regular graph within the class of threshold graphs. Using the fact that every threshold graph contains a maximal anti-regular graph, we show that some known results, and new ones, on the spectral properties of threshold graphs can be deduced from (i) the known results on the eigenvalues of anti-regular graphs, (ii) the subgraph structure of threshold graphs, and (iii) eigenvalue interlacing. In particular, we prove a strengthened version of the recently proved fact that no threshold graph contains an eigenvalue in the interval Ω = [ − 1 − 2 2 , − 1 + 2 2 ] , except possibly the trivial eigenvalues −1 and/or 0, determine the inertia of a threshold graph, and give partial results on a conjecture regarding the optimality of the non-trivial eigenvalues of an anti-regular graph within the class of threshold graphs. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
21. On Relationships of Eigenvalue--Based Topological Molecular Descriptors.
- Author
-
Redžepović, Izudin and Furtula, Boris
- Subjects
- *
MOLECULAR orbitals , *INVESTIGATIONS , *ALKANES - Abstract
Three eigenvalue-based topological molecular descriptors are compared using several datasets of alkanes. Two of them are well-known and frequently employed in various QSPR/QSAR investigations, and third-one is a newly derived whose predictive potential is yet to be proven. The relations among them are found and discussed. Structural parameters that govern these relations are identified and the corresponding formulas based on multiple linear regression have been obtained. It has been shown that all three investigated indices are encoding almost the same structural information of a molecule. They differ only by the extent of the sensitivity on a structural branching of a molecule and on the number of non-bonding molecular orbitals. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
22. On strongly regular signed graphs.
- Author
-
Stanić, Zoran
- Subjects
- *
REGULAR graphs - Abstract
In this paper we consider a concept of strong regularity of signed graphs—a generalization of strong regularity of graphs. We establish certain structural and spectral properties of such signed graphs and determine or characterize those belonging to specified classes. Theoretical results are followed by examples and discussions. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
23. A new lower bound for the energy of graphs.
- Author
-
Oboudi, Mohammad Reza
- Subjects
- *
COMPLETE graphs , *EIGENVALUES - Abstract
Let G be a simple graph with n vertices v 1 , ... , v n and m edges. Let A (G) = [ a i j ] n × n be the adjacency matrix of G , that is a i j = 1 if v i and v j are adjacent, and a i j = 0 , otherwise. Let λ 1 , ... , λ n be the eigenvalues of A (G). The energy of G , denoted by E (G) , is defined as | λ 1 | + ⋯ + | λ n |. It is well known that 2 m ≤ E (G) ≤ 2 m n. In this paper we improve the latter lower bound and prove that if all eigenvalues of G are non-zero, then E (G) ≥ 2 | λ 1 λ n | | λ 1 | + | λ n | 2 m n , where | λ 1 | ≥ ⋯ ≥ | λ n |. We show that the equality holds if and only if G = n 2 K 2 or G = p K β + 1 ⋃ q T β + 1 , where p and q are some non-negative integers and β ≥ 2 and T β + 1 is the graph K β + 1 , β + 1 ∖ M , where M is a perfect matching of K β + 1 , β + 1. Finally by studying the | λ 1 λ n | | λ 1 | + | λ n | of graphs, we find some lower bounds for the energy of graphs. In particular, we obtain that if G has no eigenvalue in the interval (− 1 , 1) , then E (G) ≥ 2 m 2 n − 2 n , and the equality holds if and only if G is the complete graph K n. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
24. Optimizing Gershgorin for symmetric matrices.
- Author
-
DeVille, Lee
- Subjects
- *
QUADRATIC equations , *SYMMETRIC matrices , *EIGENVALUES , *MATRICES (Mathematics) - Abstract
The Gershgorin Circle Theorem is a well-known and efficient method for bounding the eigenvalues of a matrix in terms of its entries. If A is a symmetric matrix, by writing A = B + x 1 , where 1 is the matrix with unit entries, we consider the problem of choosing x to give the optimal Gershgorin bound on the eigenvalues of B , which then leads to one-sided bounds on the eigenvalues of A. We show that this x can be found by an efficient linear program (whose solution can in may cases be written in closed form), and we show that for large classes of matrices, this shifting method beats all existing piecewise linear or quadratic bounds on the eigenvalues. We also apply this shifting paradigm to some nonlinear estimators and show that under certain symmetries this also gives rise to a tractable linear program. As an application, we give a novel bound on the lowest eigenvalue of a adjacency matrix in terms of the "top two" or "bottom two" degrees of the corresponding graph, and study the efficacy of this method in obtaining sharp eigenvalue estimates for certain classes of matrices. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
25. Bounds for the energy of weighted graphs.
- Author
-
Ganie, Hilal A. and Chat, Bilal A.
- Subjects
- *
WEIGHTED graphs , *GRAPH connectivity , *ABSOLUTE value , *SUM of squares , *GEOMETRIC vertices , *EIGENVALUES - Abstract
Let G be a simple connected graph with n vertices and m edges. Let W (G) = (G , w) be the weighted graph corresponding to G. Let λ 1 , λ 2 , ... , λ n be the eigenvalues of the adjacency matrix A (W (G)) of the weighted graph W (G). The energy E (W (G)) of a weighted graph W (G) is defined as the sum of absolute value of the eigenvalues of W (G). In this paper, we obtain upper bounds for the energy E (W (G)) , in terms of the sum of the squares of weights of the edges, the maximum weight, the maximum degree d 1 , the second maximum degree d 2 and the vertex covering number τ of the underlying graph G. As applications to these upper bounds we obtain some upper bounds for the energy (adjacency energy), the extended graph energy, the Randić energy and the signed energy of the connected graph G. We also obtain some new families of weighted graphs where the energy increases with increase in weights of the edges. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
26. Leading eigenvalues of adjacency matrices of star-like graphs with fixed numbers of vertices and edges.
- Author
-
Fries, William D., Jiang, Miaohua, and Bate, Michael
- Subjects
- *
EIGENVALUES , *GEOMETRIC vertices , *EDGES (Geometry) , *MATRICES (Mathematics) , *ALGEBRAIC equations - Abstract
For a sequence of adjacency matrices, describing the unfolding of a network from the graph of a star, through graphs of a broom, to the graph of a link with constant vertices and edges, we show that the leading eigenvalue (the spectral radius) satisfies a simple algebraic equation. The equation allows easy numerical computation of the leading eigenvalue as well as a direct proof of its monotonicity in terms of the maximal degree of vertices. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
27. Eigenvalue location in graphs of small clique-width.
- Author
-
Fürer, Martin, Hoppen, Carlos, Jacobs, David P., and Trevisan, Vilmar
- Subjects
- *
EIGENVALUES , *CHARTS, diagrams, etc. , *GRAPHIC methods , *GEOMETRIC congruences , *WIDTH measurement - Abstract
Abstract Finding a diagonal matrix congruent to A − c I for constants c , where A is the adjacency matrix of a graph G allows us to quickly tell the number of eigenvalues in a given interval. If G has clique-width k and a corresponding k -expression is known, then diagonalization can be done in time O (poly (k) n) where n is the order of G. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
28. The anti-adjacency matrix of a graph: Eccentricity matrix.
- Author
-
Wang, Jianfeng, Lu, Mei, Belardo, Francesco, and Randić, Milan
- Subjects
- *
MOLECULAR graph theory , *EIGENVALUES , *LAPLACIAN matrices , *DISTANCE geometry , *TREE graphs - Abstract
Abstract In this paper we introduce a new graph matrix, named the anti-adjacency matrix or eccentricity matrix, which is constructed from the distance matrix of a graph by keeping for each row and each column only the largest distances. This matrix can be interpreted as the opposite of the adjacency matrix, which is instead constructed from the distance matrix of a graph by keeping for each row and each column only the distances equal to 1. We show that the eccentricity matrix of trees is irreducible, and we investigate the relations between the eigenvalues of the adjacency and eccentricity matrices. Finally, we give some applications of this new matrix in terms of molecular descriptors, and we conclude by proposing some further research problems. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
29. Spectral characterizations of anti-regular graphs.
- Author
-
Aguilar, Cesar O., Lee, Joon-yeob, Piato, Eric, and Schweitzer, Barbara J.
- Subjects
- *
REGULAR graphs , *CHEBYSHEV polynomials , *EIGENVALUES , *GRAPH theory , *MATRICES (Mathematics) , *ASYMPTOTIC distribution - Abstract
We study the eigenvalues of the unique connected anti-regular graph A n . Using Chebyshev polynomials of the second kind, we obtain a trigonometric equation whose roots are the eigenvalues and perform elementary analysis to obtain an almost complete characterization of the eigenvalues. In particular, we show that the interval Ω = [ − 1 − 2 2 , − 1 + 2 2 ] contains only the trivial eigenvalues λ = − 1 or λ = 0 , and any closed interval strictly larger than Ω will contain eigenvalues of A n for all n sufficiently large. We also obtain bounds for the maximum and minimum eigenvalues, and for all other eigenvalues we obtain interval bounds that improve as n increases. Moreover, our approach reveals a more complete picture of the bipartite character of the eigenvalues of A n , namely, as n increases the eigenvalues are (approximately) symmetric about the number − 1 2 . We also obtain an asymptotic distribution of the eigenvalues as n → ∞ . Finally, the relationship between the eigenvalues of A n and the eigenvalues of a general threshold graph is discussed. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
30. Generating random connected planar graphs.
- Author
-
Griffith, Daniel A.
- Subjects
- *
PLANAR graphs , *GRAPH connectivity , *DATABASES , *EIGENVALUES , *PROBABILITY theory - Abstract
Connected planar graphs are of interest to a variety of scholars. Being able to simulate a database of such graphs with selected properties would support specific types of inference for spatial analysis and other network-based disciplines. This paper presents a simple, efficient, and flexible connected planar graph generator for this purpose. It also summarizes a comparison between an empirical set of specimen graphs and their simulated counterpart set, and establishes evidence for positing a conjecture about the principal eigenvalue of connected planar graphs. Finally, it summarizes a probability assessment of the algorithm’s outcomes as well as a comparison between the new algorithm and selected existing planar graph generators. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
31. On the multiplicity of α as an eigenvalue of Aα(G) of graphs with pendant vertices.
- Author
-
Cardoso, Domingos M., Pastén, Germain, and Rojo, Oscar
- Subjects
- *
EIGENVALUES , *MULTIPLICITY (Mathematics) , *GEOMETRIC vertices , *SET theory , *EIGENANALYSIS - Abstract
Let G be a simple undirected graph. Let 0 ≤ α ≤ 1 . Let A α ( G ) = α D ( G ) + ( 1 − α ) A ( G ) where D ( G ) and A ( G ) are the diagonal matrix of the vertex degrees of G and the adjacency matrix of G , respectively. Let p ( G ) > 0 and q ( G ) be the number of pendant vertices and quasi-pendant vertices of G , respectively. Let m G ( α ) be the multiplicity of α as an eigenvalue of A α ( G ) . It is proved that m G ( α ) ≥ p ( G ) − q ( G ) with equality if each internal vertex is a quasi-pendant vertex. If there is at least one internal vertex which is not a quasi-pendant vertex, the equality m G ( α ) = p ( G ) − q ( G ) + m N ( α ) is determined in which m N ( α ) is the multiplicity of α as an eigenvalue of the matrix N . This matrix is obtained from A α ( G ) taking the entries corresponding to the internal vertices which are non quasi-pendant vertices. These results are applied to search for the multiplicity of α as an eigenvalue of A α ( G ) when G is a path, a caterpillar, a circular caterpillar, a generalized Bethe tree or a Bethe tree. For the Bethe tree case, a simple formula for the nullity is given. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
32. On line graphs with maximum energy.
- Author
-
Lenes, Eber, Mallea-Zepeda, Exequiel, Robbiano, María, and Rodríguez Z., Jonnathan
- Subjects
- *
GEOMETRIC vertices , *GRAPHIC methods , *EIGENVALUES , *MATHEMATICAL bounds , *MATRICES (Mathematics) - Abstract
For an undirected simple graph G , the line graph L ( G ) is the graph whose vertex set is in one-to-one correspondence with the edge set of G where two vertices are adjacent if their corresponding edges in G have a common vertex. The energy E ( G ) is the sum of the absolute values of the eigenvalues of G . The vertex connectivity κ ( G ) is referred as the minimum number of vertices whose deletion disconnects G . The positive inertia ν + ( G ) corresponds to the number of positive eigenvalues of G . Finally, the matching number β ( G ) is the maximum number of independent edges of G . In this paper, we derive a sharp upper bound for the energy of the line graph of a graph G on n vertices having a vertex connectivity less than or equal to k . In addition, we obtain upper bounds on E ( G ) in terms of the edge connectivity, the inertia and the matching number of G . Moreover, a new family of hyperenergetic graphs is obtained. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
33. Minimizing graph of the connected graphs whose complements are bicyclic with two cycles.
- Author
-
JAVAID, Muhammad
- Subjects
- *
BICYCLIC compounds , *GRAPH connectivity , *GRAPHIC methods , *GRAPH theory , *GEOMETRIC vertices , *EIGENVALUES - Abstract
In a certain class of graphs, a graph is called minimizing if the least eigenvalue of its adjacency matrix attains the minimum. A connected graph containing two or three cycles is called a bicyclic graph if its number of edges is equal to its number of vertices plus one. In this paper, we characterize the minimizing graph among all the connected graphs that belong to a class of graphs whose complements are bicyclic with two cycles. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
34. Self-inverse unicyclic graphs and strong reciprocal eigenvalue property.
- Author
-
Bapat, R.B., Panda, S.K., and Pati, S.
- Subjects
- *
GRAPH theory , *MATRICES (Mathematics) , *SINGULAR integrals , *ISOMORPHISM (Mathematics) , *EIGENVALUES - Abstract
We consider only simple graphs. A graph G is said to be nonsingular if its adjacency matrix A ( G ) is nonsingular. The inverse of a nonsingular graph G is the unique weighted graph whose adjacency matrix is similar to the inverse of the adjacency matrix A ( G ) via a diagonal matrix of ±1s. An invertible graph G is said to be a self-inverse graph if G is isomorphic to its inverse. Let H be the class of connected bipartite graphs with unique perfect matchings. We consider the problem of characterizing the graphs in H which are self-inverse graphs. In this article, we answer this problem for the class of unicyclic graphs. The study of the strong reciprocal eigenvalue property is closely related to the study of graphs which are isomorphic to their inverse graphs. A nonsingular graph G is said to satisfy the property (SR) if the reciprocal of each eigenvalue of the adjacency matrix A ( G ) is also an eigenvalue of A ( G ) and they both have the same multiplicities. In this article, we show that if a unicyclic graph G in H has property (SR), then G is invertible and the inverse graph of G is unicyclic. As an application, we show that a noncorona unicyclic graph in H with property (SR) can have one of the five specified structures. Finally, our discussions lead to the following problem. Does there exist a unicyclic graph G ∈ H which has property (SR) but G is not self-inverse? [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
35. On some graphs which satisfy reciprocal eigenvalue properties.
- Author
-
Panda, S.K. and Pati, S.
- Subjects
- *
GRAPH theory , *EIGENVALUES , *BIPARTITE graphs , *MATRICES (Mathematics) , *VERTEX operator algebras - Abstract
We consider only simple graphs. Consider connected bipartite graphs with unique perfect matchings such that the graph obtained by contracting all matching edges is also bipartite. On the class H g of such graphs G the equivalence of the following statements are known. i) The reciprocal of the spectral radius of the adjacency matrix A ( G ) is the least positive eigenvalue of the adjacency matrix. ii) The graph is isomorphic to its inverse, where the inverse of a graph G is the unique weighted graph whose adjacency matrix is similar to the inverse of the adjacency matrix A ( G ) via a diagonal matrix of ±1s. iii) The graph has the reciprocal eigenvalue property, that is, the reciprocal of each eigenvalue of the adjacency matrix A ( G ) is also an eigenvalue of A ( G ) . iv) The graph has the strong reciprocal eigenvalue property, that is, the reciprocal of each eigenvalue of the adjacency matrix A ( G ) is also an eigenvalue of A ( G ) and they both have the same multiplicities. v) The graph is a corona graph, that is, it is obtained by taking a bipartite graph and then by inserting a new adjacent vertex of degree one at each vertex. It is known that the statements iii) and iv) are not equivalent, if we allow nonbipartite graphs. However, the equivalence of these two is not yet known for the class of bipartite graphs with unique perfect matchings, where we relax the condition of bipartiteness of the contracted graph. In this article, we establish the equivalence of the first four statements for a class larger than H g . We then supply a constructive structural description of those graphs. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
36. CONSTRUCTION OF COSPECTRAL INTEGRAL REGULAR GRAPHS.
- Author
-
BAPAT, RAVINDRA B. and KARIMI, MASOUD
- Subjects
- *
INTEGRALS , *REGULAR graphs , *EIGENVALUES , *INTEGERS , *GEOMETRIC vertices - Abstract
Graphs G and H are called cospectral if they have the same characteristic polynomial. If eigenvalues are integral, then corresponding graphs are called integral graph. In this article we introduce a construction to produce pairs of cospectral integral regular graphs. Generalizing the construction of G4(a, b) and G5(a, b) due to Wang and Sun, we define graphs G4(G,H) and G5(G,H) and show that they are cospectral integral regular when G is an integral q- regular graph of order m and H is an integral q-regular graph of order (b -- 2)m for some integer b ≥3. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
37. A note on the positive semidefiniteness of Aα(G).
- Author
-
Nikiforov, Vladimir and Rojo, Oscar
- Subjects
- *
SEMIDEFINITE programming , *GRAPH theory , *EIGENVALUES , *BIPARTITE graphs , *LAPLACIAN matrices - Abstract
Let G be a graph with adjacency matrix A ( G ) and let D ( G ) be the diagonal matrix of the degrees of G . For every real α ∈ [ 0 , 1 ] , write A α ( G ) for the matrix A α ( G ) = α D ( G ) + ( 1 − α ) A ( G ) . Let α 0 ( G ) be the smallest α for which A α ( G ) is positive semidefinite. It is known that α 0 ( G ) ≤ 1 / 2 . The main results of this paper are: (1) if G is d -regular then α 0 = − λ min ( A ( G ) ) d − λ min ( A ( G ) ) , where λ min ( A ( G ) ) is the smallest eigenvalue of A ( G ) ; (2) G contains a bipartite component if and only if α 0 ( G ) = 1 / 2 ; (3) if G is r -colorable, then α 0 ( G ) ≥ 1 / r . [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
38. A NOTE ON THE NORDHAUS-GADDUM TYPE INEQUALITY TO THE SECOND LARGEST EIGENVALUE OF A GRAPH.
- Author
-
Abreu, Nair, Brondani, André E., de Lima, Leonardo, and Oliveira, Carla
- Subjects
- *
EIGENVALUES , *GRAPH theory , *GEOMETRIC vertices , *POLYNOMIALS , *MATHEMATICAL models - Abstract
Let G be a g√aph on n ve√tices and G its complement. In this pape√, we p√ove a No√dhaus-Gaddum type inequality to the second la√gest eigenvalue of a g√aph G, λ2(G), λ2(G) + λ2(G) ≤ -1 + √ n2/2 - n + 1; when G is a g√aph with gi√th at least 5. Also, we show that the bound above is tight. Besides, we p√ove that this √esult holds fo√ some classes of connected g√aphs such as t√ees, k-cyclic, √egula√ bipa√tite and complete multipa√tite g√aphs. Based on these facts, we conjectu√e that ou√ √esult holds to any g√aph. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
39. Strong reciprocal eigenvalue property of a class of weighted graphs.
- Author
-
Bapat, R.B., Panda, S.K., and Pati, S.
- Subjects
- *
EIGENVALUES , *SET theory , *WEIGHTED graphs , *UNIQUENESS (Mathematics) , *MATRICES (Mathematics) - Abstract
Let H be the class of connected bipartite graphs G with a unique perfect matching M . For G ∈ H , let W G be the set of weight functions w on the edge set E ( G ) such that w ( e ) = 1 for each matching edge and w ( e ) > 0 for each nonmatching edge. Let G w denote the weighted graph with G ∈ H and w ∈ W G . The graph G w is said to satisfy the reciprocal eigenvalue property, property (R) , if 1 / λ is an eigenvalue of the adjacency matrix A ( G w ) whenever λ is an eigenvalue of A ( G w ) . Moreover, if the multiplicities of the reciprocal eigenvalues are the same, we say G w has the strong reciprocal eigenvalue property, property (SR) . Let H g = { G ∈ H | G / M is bipartite } , where G / M is the graph obtained from G by contracting each edge in M to a vertex. Recently in [12] , it was shown that if G ∈ H g , then G w has property (SR) for some w ∈ W G if and only if G w has property (SR) for each w ∈ W G if and only if G is a corona graph (obtained from another graph H by adding a new pendant vertex to each vertex of H ). Now we have the following questions. Is there a graph G ∈ H ∖ H g such that G w has property (SR) for each w ∈ W G ? Are there graphs G ∈ H ∖ H g such that G w never has property (SR), not even for one w ∈ W G ? Are there graphs G ∈ H such that G w has property (SR) for some w ∈ W G but not for all w ∈ W G ? In this article, we supply answers to these three questions. We also supply a graph class larger than H g where for any graph G , if G w has property (SR) for one w ∈ W G , then G is a corona graph. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
40. Conjectured bounds for the sum of squares of positive eigenvalues of a graph.
- Author
-
Elphick, Clive, Farber, Miriam, Goldberg, Felix, and Wocjan, Pawel
- Subjects
- *
SUM of squares , *EIGENVALUES , *GRAPHIC methods , *MATHEMATICAL bounds , *LOGICAL prediction - Abstract
A well known upper bound for the spectral radius of a graph, due to Hong, is that μ 1 2 ≤ 2 m − n + 1 if δ ≥ 1 . It is conjectured that for connected graphs n − 1 ≤ s + ≤ 2 m − n + 1 , where s + denotes the sum of the squares of the positive eigenvalues. The conjecture is proved for various classes of graphs, including bipartite, regular, complete q -partite, hyper-energetic, and barbell graphs. Various searches have found no counter-examples. The paper concludes with a brief discussion of the apparent difficulties of proving the conjecture in general. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
41. A new algorithm for detection of link spam contributed by zero-out link pages.
- Author
-
PATCHMUTHU, Ravi Kumar, KUMAR SINGH, Ashutosh, and MOHAN, Anand
- Subjects
- *
LINK spam (Internet) , *SEARCH engine optimization , *RANKING (Statistics) , *COMPUTER algorithms , *EIGENVECTORS - Abstract
Link spammers are constantly seeking new methods and strategies to deceive the search engine ranking algorithms. The search engines need to come up with new methods and approaches to challenge the link spammers and to maintain the integrity of the ranking algorithms. In this paper, we proposed a methodology to detect link spam contributed by zero-out link or dangling pages. We randomly selected a target page from live web pages, induced link spam according to our proposed methodology, and applied our algorithm to detect the link spam. The detail results from amazon.com pages showed that there was a considerable improvement in their PageRank after the link spam was induced; our proposed method detected the link spam by using eigenvectors and eigenvalues. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
42. CONSTRUCTION OF COSPECTRAL REGULAR GRAPHS.
- Author
-
Bapat, Ravindra B. and Karimi, Masoud
- Subjects
- *
REGULAR graphs , *POLYNOMIALS , *EIGENVALUES , *MULTIPLICITY (Mathematics) , *INTEGRALS , *MATHEMATICAL analysis - Abstract
Graphs G and H are called cospectral if they have the same characteristic polynomial, equivalently, if they have the same eigenvalues considering multiplicities. In this article we introduce a construction to produce pairs of cospectral regular graphs. We also investigate conditions under which the graphs are integral. [ABSTRACT FROM AUTHOR]
- Published
- 2016
43. Maximizing the spectral radius of k-connected graphs with given diameter.
- Author
-
Huang, Peng, Shiu, Wai Chee, and Sun, Pak Kiu
- Subjects
- *
SPECTRAL theory , *RADIUS (Geometry) , *GRAPH connectivity , *DIAMETER , *EIGENVALUES , *MATRICES (Mathematics) - Abstract
The spectral radius of a graph is the largest eigenvalue of its adjacency matrix. P. Hansen and D. Stevanović (2008) [9] determined the graphs with maximum spectral radius among all connected graphs of order n with diameter D . In this paper, we generalize this result to k -connected graphs of order n with diameter D . [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
44. On The Eigenvalue Distribution Of Adjacency Matrices For Connected Planar Graphs.
- Author
-
Griffith, Daniel A.
- Subjects
- *
EIGENVALUES , *GRAPH theory , *PLANAR graphs , *LEAST squares , *PARAMETER estimation , *DISTRIBUTION (Probability theory) - Abstract
This paper describes the previously unknown statistical distribution of adjacency matrix spectra for planar graphs, also known as spatial weights matrices, in terms of the following three readily available eigenvalue properties: extremes, rank orderings, and sums of powers. This distribution is governed by at most six parameters that, once known, allow accurate approximations of eigenvalues to be computed without resorting to numerical matrix methods applied on a case-by-case basis. Parameter estimates for illustrative real-world examples are obtained using nonlinear least squares regression techniques. Three conjectures are proposed, and graphical and trend results are reported for a diverse set of planar graph-based matrices. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
45. A note on connected bipartite graphs of fixed order and size with maximal index.
- Author
-
Petrović, Miroslav and Simić, Slobodan K.
- Subjects
- *
BIPARTITE graphs , *MAXIMAL subgroups , *EIGENVALUES , *MATRICES (Mathematics) , *GRAPH theory , *MATHEMATICAL analysis - Abstract
In this paper the unique graph with maximal index (i.e. the largest eigenvalue of the adjacency matrix) is identified among all connected bipartite graphs of order n and size n + k , under the assumption that k ≥ 0 and n ≥ k + 5 . [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
46. Non-bipartite graphs of fixed order and size that minimize the least eigenvalue.
- Author
-
Jovović, Ivana, Koledin, Tamara, and Stanić, Zoran
- Subjects
- *
BIPARTITE graphs , *EIGENVALUES , *SET theory , *MATHEMATICAL constants , *MATHEMATICAL analysis - Abstract
In this paper we determine the unique graph with minimal least eigenvalue (of the adjacency matrix) within the set of connected graphs of fixed order n and size m , whenever m = ⌈ n 2 ⌉ ⌊ n 2 ⌋ + a , where a is a fixed integral constant in [ 1 , ⌈ n 2 ⌉ − 1 ] . [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
47. On the multiplicity of the adjacency eigenvalues of graphs.
- Author
-
Bahmani, Asghar and Kiani, Dariush
- Subjects
- *
MULTIPLICITY (Mathematics) , *GRAPH theory , *EIGENVALUES , *MATRICES (Mathematics) , *MATHEMATICAL analysis - Abstract
Let G be a simple graph with the adjacency matrix A ( G ) . A well-known result of Cvetković and Gutman states that removing a pendant vertex and its neighbour, does not change the nullity of the graph. We generalize this theorem and some other theorems similar to it for an arbitrary eigenvalue of a graph. Also, for an arbitrary eigenvalue λ , we use a corresponding star set to delete some subgraphs and to determine the multiplicity of λ . We use star sets to find some Parter–Wiener vertices, in trees. We state our results for real symmetric matrices (and so for weighted graphs) and as a corollary we use them for simple graphs. Furthermore, we use these methods to obtain some results for λ = 0 , ± 1 . [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
48. The Least Eigenvalue of Graphs whose Complements Are Uni- cyclic.
- Author
-
Wang, Yi, Fan, Yi-Zheng, Li, Xiao-Xin, and Zhang, Fei-Fei
- Subjects
- *
EIGENVALUES , *GRAPH theory , *SET theory , *GRAPH connectivity , *MATHEMATICAL analysis - Abstract
A graph in a certain graph class is called minimizing if the least eigenvalue of its adjacency matrix attains the minimum among all graphs in that class. Bell et al. have identified a subclass within the connected graphs of order n and size m in which minimizing graphs belong (the complements of such graphs are either disconnected or contain a clique of size n/2 ). In this paper we discuss the minimizing graphs of a special class of graphs of order n whose complements are connected and contains exactly one cycle (namely the class Ucn of graphs whose complements are unicyclic), and characterize the unique minimizing graph in Ucn when n ≥ 20. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
49. Spectral conditions for the existence of specified paths and cycles in graphs.
- Author
-
Zhai, Mingqing, Lin, Huiqiu, and Gong, Shicai
- Subjects
- *
EXISTENCE theorems , *PATH analysis (Statistics) , *CYCLIC groups , *EIGENVALUES , *LEAST squares - Abstract
Let G be a graph with n vertices and λ n ( G ) be the least eigenvalue of its adjacency matrix of G . In this paper, we give sharp bounds on the least eigenvalue of graphs without given paths or cycles and determine the extremal graphs. This result gives spectral conditions for the existence of specified paths and cycles in graphs. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
50. Every totally real algebraic integer is a tree eigenvalue.
- Author
-
Salez, Justin
- Subjects
- *
ALGEBRA , *INTEGERS , *TREE graphs , *EIGENVALUES , *GRAPH theory - Abstract
Graph eigenvalues are examples of totally real algebraic integers, i.e. roots of real-rooted monic polynomials with integer coefficients. Conversely, the fact that every totally real algebraic integer occurs as an eigenvalue of some finite graph is a deep and remarkable result, conjectured forty years ago by Hoffman, and proved seventeen years later by Estes. This short paper provides an independent and elementary proof of a stronger statement, namely that the graph may actually be chosen to be a tree. As a by-product, our result implies that the atoms of the limiting spectrum of n × n symmetric matrices with independent Bernoulli ( c n ) entries are exactly the totally real algebraic integers. This settles an open problem raised by Ben Arous (2010). [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.