Nonuniform subset graphs associated with any graph

DOI10.1142/S1793557125500822MaRDI QIDQ7228547zbMATH OpenFDO

Authors Muhammad Nurul Huda, Yeni Susanti

Publication date 14 April 2026

Published in Asian-European Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S1793557125500822

zbMATH Keywords

nonuniform subset graphtoken graphuniform subset graph

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites work

• Computing the edge irregularity strengths of chain graphs and the join of two graphs
• Diameters of uniform subset graphs
• Extremal combinatorics. With applications in computer science
• Hamiltonian uniform subset graphs
• scientific article; zbMATH DE number 3843786 (Why is no real title available?)
• scientific article; zbMATH DE number 146670 (Why is no real title available?)
• Johnson graphs are Hamilton-connected
• Kneser's conjecture, chromatic number, and homotopy
• On the 2-token graph of a graph
• On the 2-Token Graphs of Some Disjoint Union of Graphs
• On the girth and diameter of generalized Johnson graphs
• The graphs G(n,k) of the Johnson schemes are unique for n\(\geq 20\)
• Token graphs

This page was built for publication: Nonuniform subset graphs associated with any graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7228547)