scientific article; zbMATH DE number 1179517
From MaRDI portal
Publication:4398864
Recommendations
Cited in
(only showing first 100 items - show all)- Sharp bounds for the spectral radius of digraphs
- Spectral structure of the Laplacian on a covering graph
- Highly connected random geometric graphs
- Large induced trees in \(K_r\)-free graphs
- Symmetries and the complexity of pure Nash equilibrium
- Tutte chromatic identities from the Temperley-Lieb algebra
- Integrated functionals of normal and fractional processes
- The equitable dispersion problem
- On Tutte polynomial uniqueness of twisted wheels
- Integral cycle bases for cyclic timetabling
- From a zoo to a zoology: Towards a general theory of graph polynomials
- A bijection for Eulerian-equivalence classes of totally cyclic orientations
- Harmonic analysis for graph refinements and the continuous graph FFT
- The maximum spectral radius of C₄-free graphs of given order and size
- Searching for an edge in a graph with restricted test sets
- Generalized duality for graphs on surfaces and the signed Bollobás-Riordan polynomial
- The 3-colored Ramsey number of even cycles
- Graph spectra as a systematic tool in computational biology
- Uniformly bounded information and social choice
- Vertex-compressed subalgebras of a graph von Neumann algebra
- Matchings and independent sets of a fixed size in regular graphs
- A greedy approach to compute a minimum cycle basis of a directed graph
- A lower bound on the edge \(l_{\infty }\) radius of Saitou and Nei's method for phylogenetic reconstruction
- More spectral bounds on the clique and independence numbers
- Determinant identities for Laplace matrices
- Highly connected coloured subgraphs via the regularity Lemma
- Edge search in graphs with restricted test sets
- Turán's theorem inverted
- Enhanced algorithms for local search
- Tutte's barycenter method applied to isotopies
- An application of Ramsey theorem to stopping games.
- Hamiltonian double Latin squares
- Ramsey numbers involving large dense graphs and bipartite Turán numbers
- Graphs with large maximum degree containing no odd cycles of a given length
- Zeros of the Jones polynomials for families of pretzel links
- Nearly bipartite graphs
- Partial immunization processes
- Free energy as a dynamical invariant (or can you hear the shape of a potential?)
- Semidirect product constructions of directed strongly regular graphs
- Extremal problems for ordered (hyper)graphs: Applications of Davenport-Schinzel sequences
- The expected hitting times for graphs with cutpoints.
- On the number of edges not covered by monochromatic copies of a fixed graph.
- On homomorphisms from the Hamming cube to \(\mathbb{Z}\)
- Identities for circuit partition polynomials, with applications to the Tutte polynomial
- On the algebraic complexity of some families of coloured Tutte polynomials
- Connections between loops of exponent 2, reflection structures and complete graphs with parallelism
- Exact Potts model partition function on strips of the triangular lattice
- Graph-theoretical characterization of invertible cellular automata
- On the distribution of the domination number for random class cover catch digraphs
- 4-edge-coloring graphs of maximum degree 3 in linear time
- Wavelength routing in optical networks of diameter two
- Fixed points and stability in the two-network frustrated Kuramoto model
- Synchronisation of networked Kuramoto oscillators under stable Lévy noise
- Spreading dynamics in heterogeneous graphs: beyond the assortativity coefficient
- Bertrand competition under network externalities
- Macdonald cumulants, G-inversion polynomials and G-parking functions
- Extremal graphs with diameter 2 for two indices on resistance-distance
- Limiting behavior of 3-color excitable media on arbitrary graphs
- Maximizing and minimizing multiplicative Zagreb indices of graphs subject to given number of cut edges
- A proposal on culling \& filtering a Coxeter group for 4D, \( \mathcal{N} =1\) spacetime SUSY representations: revised
- Port-Hamiltonian modeling of non-isothermal chemical reaction networks
- Graphs and metric 2-step nilpotent Lie algebras
- Weighted sampling without replacement
- Hierarchical neural networks perform both serial and parallel processing
- The multiplication table problem for bipartite graphs
- Concentric network symmetry
- On the chromatic number of structured Cayley graphs
- The power grid as a complex network: a survey
- On the sharp lower bounds of Zagreb indices of graphs with given number of cut vertices
- Systematic evaluation of a new combinatorial curvature for complex networks
- Maximal Estrada index of unicyclic graphs with perfect matching
- Consensus dynamics with arbitrary sign-preserving nonlinearities
- Ground states of nonlinear Schrödinger equation on star metric graphs
- Discovering linear-recurrent solutions to Hofstadter-like recurrences using symbolic computation
- Total rainbow connection of digraphs
- A study about the Tutte polynomials of benzenoid chains
- Duality and nonlinear graph Laplacians
- Rainbow vertex connection of digraphs
- Synchronisation under shocks: the Lévy Kuramoto model
- Singularities in Negami's splitting formula for the Tutte polynomial
- The minimum size of graphs satisfying cut conditions
- On linkedness in the Cartesian product of graphs
- Integral homology of random simplicial complexes
- Attributed transition systems with hidden transitions
- Degree powers in graphs with a forbidden forest
- Event-triggered sliding mode based consensus tracking in second order heterogeneous nonlinear multi-agent systems
- Pfaffian polyominos on the Klein bottle
- Information content based model for the topological properties of the gene regulatory network of \textit{Escherichia coli}
- Measure concentration and the weak Pinsker property
- The normalized Laplacian, degree-Kirchhoff index and the spanning tree numbers of generalized phenylenes
- Fault tolerant supergraphs with automorphisms
- Twin subgraphs and core-semiperiphery-periphery structures
- On an extension of the d'Alembert solution to initial-boundary value problems in multi-layered, multi-material domains
- Bivariate chromatic polynomials in computer algebra
- Graph vulnerability parameters, compression, and quasi-threshold graphs
- Uniform Kirchhoff graphs
- Temporal network optimization subject to connectivity constraints
- Non-commutative crepant resolutions of Hibi rings with small class group
- Enumerative combinatorics of simplicial and cell complexes: Kirchhoff and Trent type theorems
- Modeling systemic risk with Markov switching graphical SUR models
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4398864)
