On the index of tricyclic graphs with perfect matchings
DOI10.1016/J.LAA.2009.02.002zbMATH Open1175.05082OpenAlexW2065622724MaRDI QIDQ1039740FDOQ1039740
Authors: Xianya Geng, Shuchao Li, Xuechao Li
Publication date: 23 November 2009
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2009.02.002
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- On the maximal index of connected graphs
- The spectral radius of trees on \(k\) pendant vertices
- Spektren endlicher Grafen
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The largest eigenvalue of a graph: A survey
- Bounds on the largest eigenvalues of trees with a given size of matching
- Title not available (Why is that?)
- The spectral radius of tricyclic graphs with \(n\) vertices and \(k\) pendent vertices
- On the spectral radius of unicyclic graphs with perfect matchings
- On the index of bicyclic graphs with perfect matchings
- On the spectral radius of graphs with cut edges
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the spectral radius of trees with fixed diameter
- On the spectral radius of bicyclic graphs with \(n\) vertices and diameter \(d\)
- Title not available (Why is that?)
Cited In (18)
- The index semigroup and \(K\)-groups of graph-groupoid \(C^{*}\)-algebras
- Directed graphs, von Neumann algebras, and index
- On the index of tricyclic Hamiltonian graphs
- On the spectral radius of tricyclic graphs with a maximum matching
- Title not available (Why is that?)
- On a conjecture for the signless Laplacian spectral radius of cacti with given matching number
- On the lower and upper bounds for different indices of tricyclic graphs
- The tight upper bound for the number of matchings of tricyclic graphs
- On the index of bicyclic graphs with perfect matchings
- Tricyclic graphs with maximum Merrifield-Simmons index
- Tricylic hamiltonian graphs with minimal index
- On tricyclic graphs whose second largest eigenvalue does not exceed 1
- Index semigroup and indexing on von Neumann algebras
- Sharp lower bound for the total number of matchings of tricyclic graphs
- Padmakar-Ivan Index of Some Types of Perfect Graphs
- Core index of perfect matching polytope for a 2-connected cubic graph
- Extremal bicyclic graph with perfect matching for different indices
- Conjugated tricyclic graphs with the maximum zeroth-order general Randić index
This page was built for publication: On the index of tricyclic graphs with perfect matchings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1039740)