scientific article; zbMATH DE number 3222645

From MaRDI portal
Revision as of 03:11, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5510191

zbMath0137.18103MaRDI QIDQ5510191

Horst Sachs

Publication date: 1964


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



Related Items (46)

On the largest eigenvalues of treesSombor Energy and Hückel RuleOn some counting polynomials in chemistryOn the two largest eigenvalues of treesUnnamed ItemAlgorithmic uses of the Feferman-Vaught theoremSome methods for counting the spanning trees in labelled molecular graphs, examined in relation to certain fullerenesLaplacian spectral characterization of rosesOn the Characteristic Equations of the Characteristic PolynomialThe ancestral matrix of a rooted treeDigraphs with real and Gaussian spectraNull decomposition of treesFarrell polynomials on graphs of bounded tree widthCharacterization of digraphs with three complementarity eigenvaluesA new expression for matching polynomialsLaplacian matching polynomial of graphsOn discrete gradient vector fields and Laplacians of simplicial complexesOn graphs with equal dominating and c-dominating energyPermanental polynomials of graphsMathematical Aspects of Omega PolynomialLarge regular bipartite graphs with median eigenvalue 1A reduction formula for the characteristic polynomial of hypergraph with pendant edgesGrowth rates of geometric grid classes of permutationsOn the \(A_{\alpha}\)-characteristic polynomial of a graphA \(\{-1,0,1\}\)- and sparsest basis for the null space of a forest in optimal timeUnnamed ItemTrees with maximum nullityOn a general class of graph polynomialsSpectral characterization of some graphsUniversal realizability in low dimensionAn introduction to matching polynomialsAutomorphism group and category of cospectral graphsThe characteristic polynomial of a graph containing loopsComplementarity spectrum of digraphsOn a class of polynomials obtained from the circuits in a graph and its application to characteristic polynomials of graphsOn unimodal sequences of graphical invariantsGeneral Theory of Cycle-Dependence of Total pi-Electron EnergyFinite Time Stabilization of Nonautonomous First-Order Hyperbolic SystemsUnnamed ItemEigenvector-based identification of bipartite subgraphsOn the maximal-adjacency-spectrum unicyclic graphs with given maximum degreeOn the location of zeros of the Laplacian matching polynomials of graphsOn the nullity number of graphsTrace-minimal graphs and D-optimal weighing designsEvaluation of the characteristic polynomial of a graphOn the coefficients of the characteristic polynomial of a matrix







This page was built for publication: