Pages that link to "Item:Q4337503"
From MaRDI portal
The following pages link to Open problems of Paul Erd�s in graph theory (Q4337503):
Displaying 50 items.
- The normalized Laplacians, degree-Kirchhoff index and the spanning trees of linear hexagonal chains (Q290102) (← links)
- The limiting distributions of large heavy Wigner and arbitrary random matrices (Q333110) (← links)
- Path Laplacian matrices: introduction and application to the analysis of consensus in networks (Q417470) (← links)
- Fuzzy transform and least-squares approximation: Analogies, differences, and generalizations (Q429370) (← links)
- Isospectral graph reductions and improved estimates of matrices' spectra (Q445806) (← links)
- On the mean square displacement of a random walk on a graph (Q499471) (← links)
- The trees with the second smallest normalized Laplacian eigenvalue at least \(1-\frac{\sqrt{3}}{2}\) (Q507585) (← links)
- Scalable learning and inference in Markov logic networks (Q511628) (← links)
- Doing-it-all with bounded work and communication (Q529041) (← links)
- Extinction and positivity of the solutions of the heat equations with absorption on networks (Q536267) (← links)
- Electric routing and concurrent flow cutting (Q553348) (← links)
- Spread of (mis)information in social networks (Q608525) (← links)
- Enabling scalable spectral clustering for image segmentation (Q609126) (← links)
- Extinction and positivity of solutions of the \(p\)-Laplacian evolution equation on networks (Q643559) (← links)
- The number of \(K_{m,m}\)-free graphs (Q653990) (← links)
- Return probability for random walks on scale-free complex trees (Q691856) (← links)
- Spectra of generalized compositions of graphs and hierarchical networks (Q710577) (← links)
- Spectral methods for graph clustering - a survey (Q713095) (← links)
- A Sears-type self-adjointness result for discrete magnetic Schrödinger operators (Q714097) (← links)
- Equality of Lifshitz and van Hove exponents on amenable Cayley graphs (Q734314) (← links)
- Sufficient conditions of endemic threshold on metapopulation networks (Q739201) (← links)
- Local phase synchronization and clustering for the delayed phase-coupled oscillators with plastic coupling (Q739502) (← links)
- Drawing graphs by eigenvectors: theory and practice (Q814052) (← links)
- Oscillator death in coupled functional differential equations near Hopf bifurcation (Q818436) (← links)
- A Riemannian approach to graph embedding (Q856472) (← links)
- The Cauchy--Schwarz divergence and Parzen windowing: Connections to graph theory and Mercer kernels (Q860375) (← links)
- Spectral partitioning works: planar graphs and finite element meshes (Q869898) (← links)
- Resistance distance and the normalized Laplacian spectrum (Q875599) (← links)
- Old and new results on algebraic connectivity of graphs (Q876302) (← links)
- Cleaning a network with brushes (Q930892) (← links)
- A study of graph spectra for comparing graphs and trees (Q937426) (← links)
- Graph spectral image smoothing using the heat kernel (Q941573) (← links)
- Spectrum of a homogeneous graph (Q944351) (← links)
- Clique-inserted-graphs and spectral dynamics of clique-inserting (Q953479) (← links)
- An efficient algorithm for attention-driven image interpretation from segments (Q955836) (← links)
- Towards a theoretical foundation for Laplacian-based manifold methods (Q959898) (← links)
- Spectra of digraphs (Q962109) (← links)
- On the normalized Laplacian energy and general Randić index \(R_{-1}\) of graphs (Q972793) (← links)
- On the isoperimetric spectrum of graphs and its approximations (Q974467) (← links)
- Matchings in regular graphs from eigenvalues (Q1003830) (← links)
- Expanding and forwarding parameters of product graphs (Q1421485) (← links)
- The theory of elementary landscapes (Q1431939) (← links)
- Discrete Green's functions (Q1584654) (← links)
- Minimal-volume shadows of cubes (Q1585975) (← links)
- Ordering graphs with small index and its application (Q1613408) (← links)
- On the multiplicity of Laplacian eigenvalues and Fiedler partitions (Q1637997) (← links)
- Structure modeling and estimation of multiple resolvable group targets via graph theory and multi-Bernoulli filter (Q1640273) (← links)
- The journey of graph kernels through two decades (Q1706611) (← links)
- Measuring instance difficulty for combinatorial optimization problems (Q1762054) (← links)
- Optimization problems for weighted graphs and related correlation estimates (Q1827724) (← links)
