Independent sets in tensor graph powers

DOI10.1002/jgt.20194zbMath1108.05068arXivmath/0608090MaRDI QIDQ3418735

Eyal Lubetzky, Noga Alon

Publication date: 24 January 2007

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0608090

zbMATH Keywords

tensor product; independence ratio

Mathematics Subject Classification ID

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

Related Items

Unnamed Item, The super edge connectivity of Kronecker product graphs, Unnamed Item, Topological Efficiency of Some Product Graphs, Unnamed Item, The Restricted Edge-Connectivity of Kronecker Product Graphs, SUPER EDGE CONNECTIVITY OF KRONECKER PRODUCTS OF GRAPHS, ISOLATED SCATTERING NUMBER OF SPLIT GRAPHS AND GRAPH PRODUCTS, Further properties on the degree distance of graphs, A Heuristic for Direct Product Graph Decomposition, Super connectivity of Kronecker product of complete bipartite graphs and complete graphs, On the super connectivity of Kronecker products of graphs, Reciprocal degree distance of product graphs, Wiener and vertex \(PI\) indices of Kronecker products of graphs, On the ultimate categorical independence ratio, On some topological indices of the tensor products of graphs, Super connectivity of Kronecker products of graphs, Vertex vulnerability parameters of Kronecker products of complete graphs, Measure preserving homomorphisms and independent sets in tensor graph powers, A note on the connectivity of Kronecker products of graphs, Reformulated reciprocal degree distance of graph operations, On edge connectivity of direct products of graphs, Harary index of product graphs, Linear-time algorithms for tree root problems, On maximum independent set of categorical product and ultimate categorical ratios of graphs, Perfect fractional matchings in \(k\)-out hypergraphs, On independent domination in direct products, High dimensional Hoffman bound and applications in extremal combinatorics