Pages that link to "Item:Q5311920"
From MaRDI portal
The following pages link to Characterizing subgraphs of Hamming graphs (Q5311920):
Displaying 22 items.
- Recognizing Hamming graphs in linear time and space (Q287143) (← links)
- A survey and classification of Sierpiński-type graphs (Q516890) (← links)
- Diagonalized Cartesian products of \(S\)-prime graphs are \(S\)-prime (Q658020) (← links)
- Hamming dimension of a graph-the case of Sierpiński graphs (Q691596) (← links)
- Vapnik-Chervonenkis dimension and density on Johnson and Hamming graphs (Q831858) (← links)
- A characterization of the Hamming graph by strongly closed subgraphs (Q942131) (← links)
- Subdivided graphs as isometric subgraphs of Hamming graphs (Q1024304) (← links)
- Distance monotonicity and a new characterization of Hamming graphs (Q1044739) (← links)
- Isometric embeddings in Hamming graphs (Q1110526) (← links)
- Two characterizations of generalized hypercube (Q1182875) (← links)
- The retracts of Hamming graphs (Q1193717) (← links)
- The number of edges in a subgraph of a Hamming graph (Q1600356) (← links)
- Induced saturation of graphs (Q1727803) (← links)
- On the complexity of recognizing \(S\)-composite and \(S\)-prime graphs (Q1949105) (← links)
- Graphs over graded rings and relation with Hamming graph (Q2049028) (← links)
- (Q4284636) (← links)
- Cayley graphs of graded rings (Q4563588) (← links)
- Induced Embeddings into Hamming Graphs. (Q5111242) (← links)
- Betweenness centrality in Cartesian product of graphs (Q5154628) (← links)
- Partial Hamming graphs and expansion procedures (Q5939915) (← links)
- An induced subgraph of the Hamming graph with maximum degree 1 (Q6081592) (← links)
- Hamming distance between the strings generated by adjacency matrix of a subgraph complementary graph and their sum (Q6132854) (← links)
