Pages that link to "Item:Q1343771"
From MaRDI portal
The following pages link to The matching polynomial of a regular graph (Q1343771):
Displaying 19 items.
- Graphs with few matching roots (Q367053) (← links)
- The new methods for constructing matching-equivalence graphs (Q861802) (← links)
- The matching polynomial of a polygraph (Q1103634) (← links)
- The graph polynomial and the number of proper vertex colorings (Q1296159) (← links)
- Graphs determined by polynomial invariants (Q1885023) (← links)
- The matching polynomial of a distance-regular graph (Q1975936) (← links)
- Local WL invariance and hidden shades of regularity (Q2235273) (← links)
- Graphs with six distinct matching roots (Q2339593) (← links)
- On a conjecture of Wilf (Q2384576) (← links)
- On sequences of polynomials arising from graph invariants (Q2408975) (← links)
- Counting Matchings and Tree-Like Walks in Regular Graphs (Q3058300) (← links)
- (Q3211342) (← links)
- Relationship between Coefficients of Characteristic Polynomial and Matching Polynomial of Regular Graphs and its Applications (Q4617687) (← links)
- (Q4909711) (← links)
- A Pfaffian formula for matching polynomials of outerplanar graphs (Q4999332) (← links)
- Matching polynomials for some nanostar dendrimers (Q5013434) (← links)
- More on the sixth coefficient of the matching polynomial in regular graphs (Q5151764) (← links)
- (Q5241134) (← links)
- Counting configurations in designs (Q5953380) (← links)