Independent sets in tensor graph powers
From MaRDI portal
Publication:3418735
DOI10.1002/jgt.20194zbMath1108.05068arXivmath/0608090OpenAlexW2949180448MaRDI QIDQ3418735
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
Related Items (28)
Super connectivity of Kronecker product of complete bipartite graphs and complete graphs ⋮ The super edge connectivity of Kronecker product graphs ⋮ Topological Efficiency of Some Product Graphs ⋮ Unnamed Item ⋮ Wiener and vertex \(PI\) indices of Kronecker products of graphs ⋮ The Restricted Edge-Connectivity of Kronecker Product Graphs ⋮ Perfect fractional matchings in \(k\)-out hypergraphs ⋮ A Heuristic for Direct Product Graph Decomposition ⋮ On independent domination in direct products ⋮ On edge connectivity of direct products of graphs ⋮ On the super connectivity of Kronecker products of graphs ⋮ ISOLATED SCATTERING NUMBER OF SPLIT GRAPHS AND GRAPH PRODUCTS ⋮ High dimensional Hoffman bound and applications in extremal combinatorics ⋮ Reciprocal degree distance of product graphs ⋮ SUPER EDGE CONNECTIVITY OF KRONECKER PRODUCTS OF GRAPHS ⋮ Vertex vulnerability parameters of Kronecker products of complete graphs ⋮ Harary index of product graphs ⋮ Reformulated reciprocal degree distance of graph operations ⋮ Further properties on the degree distance of graphs ⋮ Unnamed Item ⋮ On the ultimate categorical independence ratio ⋮ Measure preserving homomorphisms and independent sets in tensor graph powers ⋮ On some topological indices of the tensor products of graphs ⋮ Super connectivity of Kronecker products of graphs ⋮ A note on the connectivity of Kronecker products of graphs ⋮ Unnamed Item ⋮ Linear-time algorithms for tree root problems ⋮ On maximum independent set of categorical product and ultimate categorical ratios of graphs
This page was built for publication: Independent sets in tensor graph powers
