The following pages link to David P. Jacobs (Q221640):
Displaying 47 items.
- Diagonalization of generalized lollipop graphs (Q324717) (← links)
- Eigenvalues and energy in threshold graphs (Q471959) (← links)
- A theorem of Ore and self-stabilizing algorithms for disjoint minimal dominating sets (Q501004) (← links)
- Locating the eigenvalues of trees (Q609482) (← links)
- Domination number and Laplacian eigenvalue distribution (Q901155) (← links)
- Distance-\(k\) knowledge in self-stabilizing algorithms (Q930908) (← links)
- Linear time self-stabilizing colorings (Q1014432) (← links)
- Experimenting with the identity \((xy)z=y(zx)\) (Q1314437) (← links)
- The word problem for free partially commutative, partially associative groupoids (Q1329183) (← links)
- The determinant of a tree's neighborhood matrix (Q1355240) (← links)
- A simple heuristic for maximizing service of carousel storage (Q1582692) (← links)
- Maximal matching stabilizes in time \(O(m)\) (Q1607119) (← links)
- Eigenvalue location in graphs of small clique-width (Q1625480) (← links)
- Laplacian distribution and domination (Q1684945) (← links)
- Eigenvalue location in cographs (Q1752501) (← links)
- (Q1963039) (redirect page) (← links)
- Linear-time LUP decomposition of forest-like matrices (Q1963040) (← links)
- Most Laplacian eigenvalues of a tree are small (Q2221915) (← links)
- Locating the eigenvalues for graphs of small clique-width (Q2294708) (← links)
- Eigenvalue location in threshold graphs (Q2435482) (← links)
- Polynomial recognition of equal unions in hypergraphs with few vertices of large degree (Q2458923) (← links)
- 2-split graphs (Q2718360) (← links)
- An \(O(n^2)\) algorithm for the characteristic polynomial of a tree (Q2741473) (← links)
- The resultant of Chebyshev polynomials (Q2882475) (← links)
- Computing the Characteristic Polynomial of Threshold Graphs (Q2938758) (← links)
- (Q2999990) (← links)
- Domination and Spectral Graph Theory (Q3384115) (← links)
- (Q3514129) (← links)
- Distance-k Information in Self-stabilizing Algorithms (Q3613663) (← links)
- (Q3616017) (← links)
- (Q4234281) (← links)
- The Private Neighbor Cube (Q4287938) (← links)
- Reducing the adjacency matrix of a tree (Q4379574) (← links)
- (Q4489172) (← links)
- Complexity of Recognizing Equal Unions in Families of Sets (Q4521526) (← links)
- Domination Subdivision Numbers (Q4542871) (← links)
- SELF-STABILIZING ALGORITHMS FOR ORDERINGS AND COLORINGS (Q4675877) (← links)
- (Q4933932) (← links)
- Locating Eigenvalues in Graphs (Q5094376) (← links)
- High Performance Computing - HiPC 2003 (Q5193153) (← links)
- Normalized Laplacian energy change and edge deletion (Q5280011) (← links)
- (Q5284022) (← links)
- (Q5284091) (← links)
- A Conjecture on Laplacian Eigenvalues of Trees (Q5378296) (← links)
- (Q5710448) (← links)
- A note on equal unions in families of sets (Q5951949) (← links)
- Locating Eigenvalues of Symmetric Matrices - A Survey (Q6198240) (← links)
