The following pages link to Franklin H. J. Kenter (Q254889):
Displayed 32 items.
- On the distance spectra of graphs (Q254892) (← links)
- Sharp spectral bounds of several graph parameters using eigenvector norms (Q286136) (← links)
- Item:Q254889 (redirect page) (← links)
- Discrepancy inequalities for directed graphs (Q403560) (← links)
- A linear Cheeger inequality using eigenvector norms (Q746827) (← links)
- Approximating the minimum rank of a graph via alternating projection (Q1785758) (← links)
- A zero forcing technique for bounding sums of eigenvalue multiplicities (Q1979365) (← links)
- On the error of \textit{a priori} sampling: zero forcing sets and propagation time (Q2002553) (← links)
- Computing bounds on product graph pebbling numbers (Q2283021) (← links)
- Integer-programming bounds on pebbling numbers of Cartesian-product graphs (Q2327149) (← links)
- On the Principal Permanent Rank Characteristic Sequences of Graphs and Digraphs (Q2813053) (← links)
- How to Make the Perfect Fireworks Display: Two Strategies for<i>Hanabi</i> (Q2956574) (← links)
- How to Win Your Betting Pool with Jensen′s Inequality and the Law of Large Numbers (Q4576136) (← links)
- Lower Bounds on the Distance Domination Number of a Graph (Q4598363) (← links)
- Pebbling on Graph Products and other Binary Graph Constructions (Q4616105) (← links)
- Proof of a conjecture of Graham and Lov\'asz concerning unimodality of coefficients of the distance characteristic polynomial of a tree (Q4685888) (← links)
- Interception in distance-vector routing networks (Q4985057) (← links)
- Graph Pebbling: A Blend of Graph Theory, Number Theory, and Optimization (Q5029921) (← links)
- Bounds for the Zero Forcing Number of Graphs with Large Girth (Q5225511) (← links)
- Necessary Spectral Conditions for Coloring Hypergraphs (Q5412358) (← links)
- A geometric Chung–Lu model and the Drosophila medulla connectome (Q6079515) (← links)
- (Q6119465) (← links)
- Sparsity of graphs that allow two distinct eigenvalues (Q6173926) (← links)
- Concentration of the Stationary Distribution on General Random Directed Graphs (Q6244892) (← links)
- A linear k-fold Cheeger inequality (Q6257931) (← links)
- It's good to be $\phi$: a solution to a problem of Gosper and Knuth (Q6295232) (← links)
- Pebbling on Directed Graphs with Fixed Diameter (Q6306401) (← links)
- Leaky Forcing: A New Variation of Zero Forcing (Q6326299) (← links)
- A Tale of Two Limits: An Extremal Pagerank Problem (Q6365402) (← links)
- Improved bounds on the cop number when forbidding a minor (Q6427964) (← links)
- Zero Forcing on 2-connected Outerplanar Graphs (Q6448240) (← links)
- Forts, (fractional) zero forcing, and Cartesian products of graphs (Q6456906) (← links)