The following pages link to (Q5510191):
Displaying 46 items.
- A new expression for matching polynomials (Q409433) (← links)
- Growth rates of geometric grid classes of permutations (Q490266) (← links)
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- On the maximal-adjacency-spectrum unicyclic graphs with given maximum degree (Q782328) (← links)
- On some counting polynomials in chemistry (Q1095908) (← links)
- Digraphs with real and Gaussian spectra (Q1140093) (← links)
- Permanental polynomials of graphs (Q1159214) (← links)
- On a general class of graph polynomials (Q1226488) (← links)
- Spectral characterization of some graphs (Q1226505) (← links)
- An introduction to matching polynomials (Q1229232) (← links)
- On a class of polynomials obtained from the circuits in a graph and its application to characteristic polynomials of graphs (Q1255017) (← links)
- On unimodal sequences of graphical invariants (Q1257030) (← links)
- Evaluation of the characteristic polynomial of a graph (Q1310247) (← links)
- On the coefficients of the characteristic polynomial of a matrix (Q1322277) (← links)
- On the two largest eigenvalues of trees (Q1361770) (← links)
- Farrell polynomials on graphs of bounded tree width (Q1398293) (← links)
- Null decomposition of trees (Q1690257) (← links)
- On the \(A_{\alpha}\)-characteristic polynomial of a graph (Q1743145) (← links)
- A \(\{-1,0,1\}\)- and sparsest basis for the null space of a forest in optimal time (Q1747105) (← links)
- Trees with maximum nullity (Q1774973) (← links)
- On the largest eigenvalues of trees (Q1877649) (← links)
- Some methods for counting the spanning trees in labelled molecular graphs, examined in relation to certain fullerenes (Q1917322) (← links)
- Universal realizability in low dimension (Q2020659) (← links)
- The characteristic polynomial of a graph containing loops (Q2030251) (← links)
- Complementarity spectrum of digraphs (Q2041759) (← links)
- On the location of zeros of the Laplacian matching polynomials of graphs (Q2082524) (← links)
- Laplacian matching polynomial of graphs (Q2196481) (← links)
- A reduction formula for the characteristic polynomial of hypergraph with pendant edges (Q2228496) (← links)
- Eigenvector-based identification of bipartite subgraphs (Q2328104) (← links)
- Laplacian spectral characterization of roses (Q2412691) (← links)
- The ancestral matrix of a rooted tree (Q2419059) (← links)
- Large regular bipartite graphs with median eigenvalue 1 (Q2447959) (← links)
- Trace-minimal graphs and D-optimal weighing designs (Q2576216) (← links)
- On graphs with equal dominating and c-dominating energy (Q2690866) (← links)
- Mathematical Aspects of Omega Polynomial (Q2980022) (← links)
- On the Characteristic Equations of the Characteristic Polynomial (Q3220631) (← links)
- Finite Time Stabilization of Nonautonomous First-Order Hyperbolic Systems (Q3382778) (← links)
- Automorphism group and category of cospectral graphs (Q4156799) (← links)
- (Q4617707) (← links)
- General Theory of Cycle-Dependence of Total pi-Electron Energy (Q4617784) (← links)
- On the nullity number of graphs (Q5006628) (← links)
- Sombor Energy and Hückel Rule (Q5051400) (← links)
- (Q5060665) (← links)
- (Q5228090) (← links)
- Characterization of digraphs with three complementarity eigenvalues (Q6098209) (← links)
- On discrete gradient vector fields and Laplacians of simplicial complexes (Q6192066) (← links)