Paths in graphs
From MaRDI portal
Publication:4780288
DOI10.1556/SScMath.38.2001.1-4.8zbMath0997.05049OpenAlexW2093889116MaRDI QIDQ4780288
Publication date: 3 November 2002
Published in: Studia Scientiarum Mathematicarum Hungarica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1556/sscmath.38.2001.1-4.8
maximal number of paths of lengths \(s\) in a graph with \(m\) edgesmaximal number of subgraphs isomorphic to a given graph
Related Items (only showing first 100 items - show all)
Bounded quantifier depth spectra for random graphs ⋮ Paths of length four ⋮ Networks beyond pairwise interactions: structure and dynamics ⋮ A decomposability index in logical analysis of data ⋮ Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle ⋮ Probabilistic analysis of upper bounds for 2-connected distance \(k\)-dominating sets in graphs ⋮ Data reductions, fixed parameter tractability, and random weighted \(d\)-CNF satisfiability ⋮ An improved algorithm for approximating the chromatic number of \(G_{n,p}\) ⋮ Symmetric graph properties have independent edges ⋮ Triangles in random cubic planar graphs ⋮ On spanning structures in random hypergraphs ⋮ Results on the Wiener profile ⋮ The union-closed sets conjecture almost holds for almost all random bipartite graphs ⋮ Uniform sampling of directed and undirected graphs conditional on vertex connectivity ⋮ When is a random graph projective? ⋮ On the zero-one \(k\)-law extensions ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ The neighborhood complex of a random graph ⋮ Codes identifying sets of vertices in random networks ⋮ Consensus of noisy multiagent systems with Markovian switching topologies and time-varying delays ⋮ On the asymptotic number of inequivalent binary self-dual codes ⋮ A comparative power analysis of the maximum degree and size invariants for random graph inference ⋮ The stability of conventions: random and lattice matching networks compared ⋮ The evolution of genetic topologies ⋮ Hodge-Kodaira decomposition of evolving neural networks ⋮ Asymptotic behaviour of estimates of link probability in random networks ⋮ Treewidth of Erdős-Rényi random graphs, random intersection graphs, and scale-free random graphs ⋮ Analysis of an iterated local search algorithm for vertex cover in sparse random graphs ⋮ Jamming in complex networks with degree correlation ⋮ Some results on approximate 1-median selection in metric spaces ⋮ Zero-one \(k\)-law ⋮ Diffusion and cascading behavior in random networks ⋮ Sparse partition universal graphs for graphs of bounded degree ⋮ Cores of random \(r\)-partite hypergraphs ⋮ Stable network topologies using the notion of covering ⋮ The adjacent vertex distinguishing total chromatic number ⋮ Geodesic cycles in random graphs ⋮ Conflict and error prevention and detection in complex networks ⋮ Average update times for fully-dynamic all-pairs shortest paths ⋮ Synchronizability of networks of chaotic systems coupled via a graph with a prescribed degree sequence ⋮ Traceability codes ⋮ The large deviation principle for the Erdős-Rényi random graph ⋮ On the clique-game ⋮ Identifying stable network structures and sets of key players using a \(W\)-covering perspective ⋮ An approximate version of Sumner's universal tournament conjecture ⋮ Expansion properties of a random regular graph after random vertex deletions ⋮ Characterisations and examples of graph classes with bounded expansion ⋮ Some geometric and dynamical properties of the Urysohn space ⋮ Modeling systemic risk with Markov switching graphical SUR models ⋮ On sets of integers with restrictions on their products ⋮ Dense subgraphs in random graphs ⋮ Independent sets in graphs ⋮ PageRank on inhomogeneous random digraphs ⋮ Tropical dominating sets in vertex-coloured graphs ⋮ Competition for the access to and use of information in networks ⋮ Large independent sets in general random intersection graphs ⋮ A randomized algorithm for the joining protocol in dynamic distributed networks ⋮ Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sums ⋮ On the generalized Wiener polarity index of trees with a given diameter ⋮ Size-Ramsey numbers of cycles versus a path ⋮ Incremental single-source shortest paths in digraphs with arbitrary positive arc weights ⋮ Anti-Ramsey properties of random graphs ⋮ Small subgraphs in random graphs and the power of multiple choices ⋮ Coarse-grained bifurcation analysis and detection of criticalities of an individual-based epidemiological network model with infection control ⋮ Average-case analysis of incremental topological ordering ⋮ Maintaining dynamic minimum spanning trees: an experimental study ⋮ Variance of the subgraph count for sparse Erdős-Rényi graphs ⋮ Last passage percolation on the complete graph ⋮ The small world effect on the coalescing time of random walks ⋮ The Laplacian energy of random graphs ⋮ Expected values of parameters associated with the minimum rank of a graph ⋮ Existential monadic second order convergence law fails on sparse random graphs ⋮ The asymptotic value of the Randić index for trees ⋮ Stochastic epidemic models: a survey ⋮ Interpolating between bounds on the independence number ⋮ Globally exponential synchronization in an array of asymmetric coupled neural networks ⋮ Thresholding random geometric graph properties motivated by ad hoc sensor networks ⋮ Understanding the scalability of Bayesian network inference using clique tree growth curves ⋮ A note on competitive diffusion through social networks ⋮ Spectral bounds for unconstrained \((- 1,1)\)-quadratic optimization problems ⋮ Block-diagonal semidefinite programming hierarchies for 0/1 programming ⋮ The degree sequences of an asymmetrical growing network ⋮ Algebraic and topological indices of molecular pathway networks in human cancers ⋮ Broadcasting in dynamic radio networks ⋮ Optimal construction of \(k\)-nearest-neighbor graphs for identifying noisy clusters ⋮ Topology of random clique complexes ⋮ A note on the chromatic number of a dense random graph ⋮ A scale-free graph model based on bipartite graphs ⋮ Spreading messages ⋮ Asymptotic probabilities of extension properties and random \(l\)-colourable structures ⋮ Optimal stopping in a search for a vertex with full degree in a random graph ⋮ Expander properties and the cover time of random intersection graphs ⋮ Random regular graphs of non-constant degree: concentration of the chromatic number ⋮ The evolution of the min-min random graph process ⋮ Connectivity of the uniform random intersection graph ⋮ Note on matching preclusion number of random graphs ⋮ On a random graph evolving by degrees ⋮ Singular value decomposition of large random matrices (for two-way classification of microarrays) ⋮ Directed cycles and related structures in random graphs. I: Static properties ⋮ Some colouring problems for Paley graphs
This page was built for publication: Paths in graphs
