scientific article

From MaRDI portal
Publication:3649250

zbMath1273.92080MaRDI QIDQ3649250

Roberto Todeschini, Viviana Consonni

Publication date: 3 December 2009


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (35)

Unnamed ItemOn the distance spread of cacti and bicyclic graphsBounds on the Reciprocal distance energy and Reciprocal distance Laplacian energies of a graphThe distance spectrum and energy of the compositions of regular graphsDistance spectral radius of trees with given matching numberThe normalized incidence energy of a graphOn the spectra of generalized Fibonomial and Jacobsthal-binomial graphsOn generalized distance spectral radius and generalized distance energy of graphsThe eccentricity spread of weak-friendship graphsOn the distance spectra ofm-generationn-prism graphOn generalized distance energy of graphsThe generalized path matrix and energyGeneralized ABC energy of weighted graphsOn graphs with equal dominating and c-dominating energyDistance spectral radius of graphs with \(r\) pendent verticesRetracted article: On the Kirchhoff matrix, a new Kirchhoff index and the Kirchhoff energyOn the distance spectral radius of cactiInertia and distance energy of line graphs of unicyclic graphsThe inertia and energy of distance matrices of complete \(k\)-partite graphsCharacterizing graphs with maximal Laplacian Estrada indexExtremal unicyclic graphs with minimal distance spectral radiusThe inertia and energy of the distance matrix of a connected graphThe distance energy of clique treesEnergy of matricesDistance spectra of graphs: a surveyDistance spectra and distance energy of integral circulant graphsUnnamed ItemDistance Spectral Radius of Some k-partitioned Transmission Regular GraphsOn adjacency-distance spectral radius and spread of graphsAutobiography of Roberto TodeschiniUnnamed ItemOn the order equivalence relation of binary association measuresUnnamed ItemUnnamed ItemOn graphs with near minimal distance energy







This page was built for publication: