scientific article; zbMATH DE number 3222645
From MaRDI portal
Publication:5510191
zbMath0137.18103MaRDI QIDQ5510191
Publication date: 1964
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (46)
On the largest eigenvalues of trees ⋮ Sombor Energy and Hückel Rule ⋮ On some counting polynomials in chemistry ⋮ On the two largest eigenvalues of trees ⋮ Unnamed Item ⋮ Algorithmic uses of the Feferman-Vaught theorem ⋮ Some methods for counting the spanning trees in labelled molecular graphs, examined in relation to certain fullerenes ⋮ Laplacian spectral characterization of roses ⋮ On the Characteristic Equations of the Characteristic Polynomial ⋮ The ancestral matrix of a rooted tree ⋮ Digraphs with real and Gaussian spectra ⋮ Null decomposition of trees ⋮ Farrell polynomials on graphs of bounded tree width ⋮ Characterization of digraphs with three complementarity eigenvalues ⋮ A new expression for matching polynomials ⋮ Laplacian matching polynomial of graphs ⋮ On discrete gradient vector fields and Laplacians of simplicial complexes ⋮ On graphs with equal dominating and c-dominating energy ⋮ Permanental polynomials of graphs ⋮ Mathematical Aspects of Omega Polynomial ⋮ Large regular bipartite graphs with median eigenvalue 1 ⋮ A reduction formula for the characteristic polynomial of hypergraph with pendant edges ⋮ Growth rates of geometric grid classes of permutations ⋮ On the \(A_{\alpha}\)-characteristic polynomial of a graph ⋮ A \(\{-1,0,1\}\)- and sparsest basis for the null space of a forest in optimal time ⋮ Unnamed Item ⋮ Trees with maximum nullity ⋮ On a general class of graph polynomials ⋮ Spectral characterization of some graphs ⋮ Universal realizability in low dimension ⋮ An introduction to matching polynomials ⋮ Automorphism group and category of cospectral graphs ⋮ The characteristic polynomial of a graph containing loops ⋮ Complementarity spectrum of digraphs ⋮ On a class of polynomials obtained from the circuits in a graph and its application to characteristic polynomials of graphs ⋮ On unimodal sequences of graphical invariants ⋮ General Theory of Cycle-Dependence of Total pi-Electron Energy ⋮ Finite Time Stabilization of Nonautonomous First-Order Hyperbolic Systems ⋮ Unnamed Item ⋮ Eigenvector-based identification of bipartite subgraphs ⋮ On the maximal-adjacency-spectrum unicyclic graphs with given maximum degree ⋮ On the location of zeros of the Laplacian matching polynomials of graphs ⋮ On the nullity number of graphs ⋮ Trace-minimal graphs and D-optimal weighing designs ⋮ Evaluation of the characteristic polynomial of a graph ⋮ On the coefficients of the characteristic polynomial of a matrix
This page was built for publication:
