A partially ordered set of functionals corresponding to graphs
From MaRDI portal
Publication:1332414
DOI10.1016/0012-365X(94)90388-3zbMath0805.05007MaRDI QIDQ1332414
Publication date: 26 January 1995
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (9)
Extremal \(H\)-colorings of trees and 2-connected graphs ⋮ Counting Walks and Graph Homomorphisms via Markov Chains and Importance Sampling ⋮ Estimating global subgraph counts by sampling ⋮ Graph homomorphisms between trees ⋮ Maximizing and minimizing the number of generalized colorings of trees ⋮ Colored graph homomorphisms ⋮ Maximizing H‐Colorings of Connected Graphs with Fixed Minimum Degree ⋮ Homomorphisms of Trees into a Path ⋮ On local weak limit and subgraph counts for sparse random graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cycles in graphs and functional inequalities
- The number of mappings of graphs, an ordering of graphs, and Muirhead's theorem
- Bounds for the number of mappings of graphs and for the number of subgraphs
- Estimates of general Mayer graphs. I. Construction of upper bounds for a given graph by means of sets of subgraphs. III. Upper bounds obtained by means of spanning n-trees. IV. On the computation of Gaussian integrals by star-mesh transformation
- Proof of London's conjecture on sums of elements of positive matrices
- The sum of the elements of the powers of a matrix
- Two inequalities in nonnegative symmetric matrices
- Inequalities in probability theory and turán-type problems for graphs with colored vertices
- Inequalities for functionals generated by bipartite graphs
- A MATRIX INEQUALITY
- A Holder Type Inequality for Symmetric Matrices with Nonnegative Entries
- Three observations on nonnegative matrices
This page was built for publication: A partially ordered set of functionals corresponding to graphs
