Relevant bibliographies by topics / Connectivity eigenvalue

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Conference papers

Academic literature on the topic 'Connectivity eigenvalue'

Author: Grafiati
Published: 2 June 2025
Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Connectivity eigenvalue.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Connectivity eigenvalue"

1

Abiad, Aida, Boris Brimkov, Xavier Martinez-Rivera, Suil O, and Jingmei Zhang. "Spectral Bounds for the Connectivity of Regular Graphs with Given Order." Electronic Journal of Linear Algebra 34 (February 21, 2018): 428–43. http://dx.doi.org/10.13001/1081-3810.3675.

Full text
Abstract:
The second-largest eigenvalue and second-smallest Laplacian eigenvalue of a graph are measures of its connectivity. These eigenvalues can be used to analyze the robustness, resilience, and synchronizability of networks, and are related to connectivity attributes such as the vertex- and edge-connectivity, isoperimetric number, and characteristic path length. In this paper, two upper bounds are presented for the second-largest eigenvalues of regular graphs and multigraphs of a given order which guarantee a desired vertex- or edge-connectivity. The given bounds are in terms of the order and degre
APA, Harvard, Vancouver, ISO, and other styles
2

Manickam, Machasri, and Kalyani Desikan. "Relationship Between the Second Largest Adjacency and Signless Laplacian Eigenvalues of Graphs and Properties of Planar Graphs." European Journal of Pure and Applied Mathematics 17, no. 4 (2024): 3004–21. https://doi.org/10.29020/nybg.ejpam.v17i4.5364.

Full text
Abstract:
A graph’s second largest eigenvalue is a significant algebraic characteristic that provides details on the graph’s expansion, connectivity, and randomness. Bounds for the second largest eigenvalue of a graph, denoted as λ2 were previously established in the literature in relation to graph parameters like edge connectivity and vertex connectivity, matching number, independencenumber, and edge expansion constant, among others. A graph is planar if it can be drawn in a plane without graph edges crossing. Determining the planarity of a graph helps in optimizing, simplifying, and understanding comp
APA, Harvard, Vancouver, ISO, and other styles
3

Rangasamy, Buvaneswari, Senbaga Priya Karuppusamy, and Farshid Mofidnakhaei. "Novel Spectral Conditions for Diagonalizability and Connectivity in Spectral Fuzzy Graph Theory." Journal of Physical Sciences 29, no. 00 (2024): 47–59. https://doi.org/10.62424/jps.2024.29.00.06.

Full text
Abstract:
This paper explores the properties of fuzzy matrices in fuzzy graphs and the conditions for the diagonalizability of fuzzy matrices. Necessary and sufficient conditions for fuzzy graphs to have non-negative and distinct eigenvalues are provided, and the existence of orthogonal eigenvectors corresponding to distinct eigenvalues in fuzzy matrices are discussed. Also, conditions for the second smallest eigenvalue of the Laplacian matrix are established to ensure connectivity in fuzzy graphs.
APA, Harvard, Vancouver, ISO, and other styles
4

Qu, Jijun, Zhijian Ji, Chong Lin, and Haisheng Yu. "Fast Consensus Seeking on Networks with Antagonistic Interactions." Complexity 2018 (December 16, 2018): 1–15. http://dx.doi.org/10.1155/2018/7831317.

Full text
Abstract:
It is well known that all agents in a multiagent system can asymptotically converge to a common value based on consensus protocols. Besides, the associated convergence rate depends on the magnitude of the smallest nonzero eigenvalue of Laplacian matrix L. In this paper, we introduce a superposition system to superpose to the original system and study how to change the convergence rate without destroying the connectivity of undirected communication graphs. And we find the result if the eigenvector x of eigenvalue λ has two identical entries xi=xj, then the weight and existence of the edge eij d
APA, Harvard, Vancouver, ISO, and other styles
5

Alshamary, Bader, Milica Anđelić, Edin Dolićanin, and Zoran Stanić. "Controllable multi-agent systems modeled by graphs with exactly one repeated degree." AIMS Mathematics 9, no. 9 (2024): 25689–704. http://dx.doi.org/10.3934/math.20241255.

Full text
Abstract:
<p>We consider the controllability of multi-agent dynamical systems modeled by a particular class of bipartite graphs, called chain graphs. Our main focus is related to chain graphs with exactly one repeated degree. We determine all chain graphs with this structural property and derive some properties of their Laplacian eigenvalues and associated eigenvectors. On the basis of the obtained theoretical results, we compute the minimum number of leading agents that make the system in question controllable and locate the leaders in the corresponding graph. Additionaly, we prove that a chain g
APA, Harvard, Vancouver, ISO, and other styles
6

Sun, Yan, and Faxu Li. "Algebraic Connectivity and Disjoint Vertex Subsets of Graphs." Mathematical Problems in Engineering 2020 (July 31, 2020): 1–6. http://dx.doi.org/10.1155/2020/5763218.

Full text
Abstract:
It is well known that the algebraic connectivity of a graph is the second small eigenvalue of its Laplacian matrix. In this paper, we mainly research the relationships between the algebraic connectivity and the disjoint vertex subsets of graphs, which are presented through some upper bounds on algebraic connectivity.
APA, Harvard, Vancouver, ISO, and other styles
7

Manickam, Machasri, and Kalyani Desikan. "Eigenvalue Interlacing of Bipartite Graphs and Construction of Expander Code using Vertex-split of a Bipartite Graph." European Journal of Pure and Applied Mathematics 17, no. 2 (2024): 772–89. http://dx.doi.org/10.29020/nybg.ejpam.v17i2.5057.

Full text
Abstract:
The second largest eigenvalue of a graph is an important algebraic parameter which is related with the expansion, connectivity and randomness properties of a graph. Expanders are highly connected sparse graphs. In coding theory, Expander codes are Error Correcting codes made up of bipartite expander graphs. In this paper, first we prove the interlacing of the eigenvalues of the adjacency matrix of the bipartite graph with the eigenvalues of the bipartite quotient matrices of the corresponding graph matrices. Then we obtain bounds for the second largest and second smallest eigenvalues. Since th
APA, Harvard, Vancouver, ISO, and other styles
8

Wen, Zhiyong, Xiaoxiong Weng, and Pengfei Zhang. "Evaluating the Connectivity and Imbalance Contribution of New Sections towards Highway Network: A Complex Network Perspective." Journal of Advanced Transportation 2023 (November 1, 2023): 1–13. http://dx.doi.org/10.1155/2023/6616512.

Full text
Abstract:
The evaluation of the impacts of new sections on the highway network is an essential aspect of the feasibility study. Existing studies predominantly concentrated on engineering-oriented feasibility assessments, often overlooking their potential effects on parallel sections and the overall network. In this research, we present an evaluation model for new sections based on complex networks, focusing on the connectivity and imbalance of transportation networks. This model serves as a supplementary approach for enhancing the feasibility analysis of new highway projects. The model comprises three d
APA, Harvard, Vancouver, ISO, and other styles
9

Liu, Huiqing, Mei Lu, and Feng Tian. "Edge-connectivity and (signless) Laplacian eigenvalue of graphs." Linear Algebra and its Applications 439, no. 12 (2013): 3777–84. http://dx.doi.org/10.1016/j.laa.2013.10.017.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Ye, Miao-Lin, Yi-Zheng Fan, and Dong Liang. "The least eigenvalue of graphs with given connectivity." Linear Algebra and its Applications 430, no. 4 (2009): 1375–79. http://dx.doi.org/10.1016/j.laa.2008.10.031.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Connectivity eigenvalue"

1

Wappler, Markus. "On Graph Embeddings and a new Minor Monotone Graph Parameter associated with the Algebraic Connectivity of a Graph." Doctoral thesis, Universitätsbibliothek Chemnitz, 2013. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-qucosa-115518.

Full text
Abstract:
We consider the problem of maximizing the second smallest eigenvalue of the weighted Laplacian of a (simple) graph over all nonnegative edge weightings with bounded total weight. We generalize this problem by introducing node significances and edge lengths. We give a formulation of this generalized problem as a semidefinite program. The dual program can be equivalently written as embedding problem. This is fifinding an embedding of the n nodes of the graph in n-space so that their barycenter is at the origin, the distance between adjacent nodes is bounded by the respective edge length, and the
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Connectivity eigenvalue"

1

Mehrpouyan, Hoda, Brandon Haley, Andy Dong, Irem Y. Tumer, and Chris Hoyle. "Resilient Design of Complex Engineered Systems." In ASME 2013 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2013. http://dx.doi.org/10.1115/detc2013-13248.

Full text
Abstract:
This paper presents a complex network and graph spectral approach to calculate the resiliency of complex engineered systems. Resiliency is a key driver in how systems are developed to operate in an unexpected operating environment, and how systems change and respond to the environments in which they operate. This paper deduces resiliency properties of complex engineered systems based on graph spectra calculated from their adjacency matrix representations, which describes the physical connections between components in a complex engineered systems. In conjunction with the adjacency matrix, the d
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Connectivity eigenvalue' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography