Some physical and chemical indices of clique-inserted lattices
From MaRDI portal
Publication:3301409
DOI10.1088/1742-5468/2013/10/P10004zbMATH Open1456.82207arXiv1302.5932OpenAlexW3106045162MaRDI QIDQ3301409FDOQ3301409
Publication date: 11 August 2020
Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)
Abstract: The operation of replacing every vertex of an -regular lattice by a complete graph of order is called clique-inserting, and the resulting lattice is called the clique-inserted-lattice of . For any given -regular lattice, applying this operation iteratively, an infinite family of -regular lattices is generated. Some interesting lattices including the 3-12-12 lattice can be constructed this way. In this paper, we reveal the relationship between the energy and resistance distance of an -regular lattice and that of its clique-inserted-lattice. As an application, the asymptotic energy per vertex and average resistance distance of the 3-12-12 and 3-6-24 lattices are computed. We also give formulae expressing the numbers of spanning trees and dimers of the -th iterated clique-inserted lattices in terms of that of the original lattice. Moreover, we show that new families of expander graphs can be constructed from the known ones by clique-inserting.
Full work available at URL: https://arxiv.org/abs/1302.5932
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graph Energy
- Statistical Mechanics of Dimers on a Plane Lattice
- Dimer problem in statistical mechanics-an exact result
- Asymptotic Enumeration of Spanning Trees
- On the Kirchhoff index of some toroidal lattices
- Expander graphs and their applications
- Kirchhoff index in line, subdivision and total graphs of a regular graph
- Ramanujan graphs
- The asymptotic behavior of some indices of iterated line graphs of regular graphs
- Spanning trees on graphs and lattices inddimensions
- On the number of spanning trees on various lattices
- DIMERS ON TWO-DIMENSIONAL LATTICES
- Spectra of the neighbourhood corona of two graphs
- Clique-inserted-graphs and spectral dynamics of clique-inserting
- On the number of perfect matchings of line graphs
Cited In (15)
- The critical group of a clique-inserted graph
- On the incidence energy of some toroidal lattices
- On degree resistance distance of cacti
- Asymptotic Laplacian-energy-like invariant of lattices
- Resistance distance-based graph invariants of subdivisions and triangulations of graphs
- A unified approach to the asymptotic topological indices of various lattices
- Two-point resistances and random walks on stellated regular graphs
- Resistance distances in corona and neighborhood corona networks based on Laplacian generalized inverse approach
- Asymptotic incidence energy of lattices
- Complete characterization of bicyclic graphs with minimal Kirchhoff index
- The spectrum and Laplacian spectrum of the dice lattice
- A note on ‘some physical and chemical indices of clique-inserted lattices’
- Some physical and chemical indices of the Union Jack lattice
- Spectra of \((H_1, H_2)\)-merged subdivision graph of a graph
- Spectral analysis of weighted neighborhood networks
This page was built for publication: Some physical and chemical indices of clique-inserted lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3301409)