The following pages link to (Q5302113):
Displaying 50 items.
- Improved upper bounds on the domination number of graphs with minimum degree at least five (Q292247) (← links)
- Sharp upper bounds for generalized edge-connectivity of product graphs (Q339466) (← links)
- Sierpiński graphs as spanning subgraphs of Hanoi graphs (Q352716) (← links)
- Coloring Hanoi and Sierpiński graphs (Q411656) (← links)
- Determinants of box products of paths (Q418902) (← links)
- On Cartesian products having a minimum dominating set that is a box or a stairway (Q497315) (← links)
- On clique convergence of graphs (Q504155) (← links)
- Matching extension in prism graphs (Q512532) (← links)
- A survey and classification of Sierpiński-type graphs (Q516890) (← links)
- On color-preserving automorphisms of Cayley graphs of odd square-free order (Q517355) (← links)
- A local prime factor decomposition algorithm (Q536219) (← links)
- Total domination dot-critical graphs (Q617644) (← links)
- On the domination number and the 2-packing number of Fibonacci cubes and Lucas cubes (Q639084) (← links)
- Diagonalized Cartesian products of \(S\)-prime graphs are \(S\)-prime (Q658020) (← links)
- Regular embeddings of Cartesian product graphs (Q658048) (← links)
- Strong geodetic problem in grid-like architectures (Q723639) (← links)
- The \(b\)-chromatic index of a graph (Q745926) (← links)
- Thinness of product graphs (Q831864) (← links)
- Vizing's conjecture for graphs with domination number 3 -- a new proof (Q888596) (← links)
- Dependence polynomials of some graph operations (Q895839) (← links)
- Domination criticality in product graphs (Q896090) (← links)
- On the stability of the Cartesian product of a neural ring and an arbitrary neural network (Q1620710) (← links)
- On two generalized connectivities of graphs (Q1692646) (← links)
- Partition distance in graphs (Q1703394) (← links)
- Algorithm to find a maximum 2-packing set in a cactus (Q1748991) (← links)
- On the complexity of recognizing \(S\)-composite and \(S\)-prime graphs (Q1949105) (← links)
- Structure of Fibonacci cubes: a survey (Q1956242) (← links)
- Strong geodetic number of complete bipartite graphs, crown graphs and hypercubes (Q1988584) (← links)
- On general position sets in Cartesian products (Q2041227) (← links)
- On the isometric path partition problem (Q2042617) (← links)
- The general position problem on Kneser graphs and on some graph operations (Q2042634) (← links)
- On the treewidth of Hanoi graphs (Q2077387) (← links)
- Connected domination game played on Cartesian products (Q2111699) (← links)
- Strong edge coloring of Cayley graphs and some product graphs (Q2115170) (← links)
- Embedding grid graphs on surfaces (Q2127724) (← links)
- Generalized adjacency and Laplacian spectra of the weighted corona graphs (Q2161928) (← links)
- Extendability and criticality in matching theory (Q2175791) (← links)
- On the fold thickness of graphs (Q2189329) (← links)
- The general position number of Cartesian products involving a factor with small diameter (Q2242842) (← links)
- Adjacency on the order polytope with applications to the theory of fuzzy measures (Q2270242) (← links)
- A lower bound and several exact results on the \(d\)-lucky number (Q2284776) (← links)
- Strong geodetic cores and Cartesian product graphs (Q2286132) (← links)
- Lattices from tight frames and vertex transitive graphs (Q2325750) (← links)
- Spectra of graphs resulting from various graph operations and products: a survey (Q2326545) (← links)
- On the ensemble of optimal dominating and locating-dominating codes in a graph (Q2346565) (← links)
- Intervals and convex sets in strong product of graphs (Q2376077) (← links)
- On constructing normal and non-normal Cayley graphs (Q2404388) (← links)
- On minimum identifying codes in some Cartesian product graphs (Q2409538) (← links)
- A sharp lower bound for the generalized 3-edge-connectivity of strong product graphs (Q2409788) (← links)
- Betweenness centrality in Cartesian product of graphs (Q2413374) (← links)
