Pages that link to "Item:Q2187747"

The following pages link to A combinatorial method for computing characteristic polynomials of starlike hypergraphs (Q2187747):

Displaying 10 items.

• A characterization of star-symmetric hypergraphs (Q1196585) (← links)
• The characteristic polynomial of the complete 3-uniform hypergraph (Q2041782) (← links)
• A reduction formula for the characteristic polynomial of hypergraph with pendant edges (Q2228496) (← links)
• The cyclic index of adjacency tensor of generalized power hypergraphs (Q2659241) (← links)
• A method to calculate the characteristic polynomials of a graph on \(n\) vertices by the aid of a computer (Q2858617) (← links)
• The characteristic polynomials of uniform double hyperstars and uniform hypertriangles (Q6083981) (← links)
• Algebraic and geometric multiplicities for some hypergraphs (Q6184550) (← links)
• On a relationship between the characteristic and matching polynomials of a uniform hypertree (Q6204332) (← links)
• The zero eigenvalue of the Laplacian tensor of a uniform hypergraph (Q6546562) (← links)
• The algebraic multiplicity of the spectral radius of a uniform hypertree (Q6635173) (← links)