The following pages link to (Q4523707):
Displaying 50 items.
- Fast recognition algorithms for classes of partial cubes (Q1408812) (← links)
- On the independence graph of a graph (Q1412670) (← links)
- Cubic inflation, mirror graphs, regular maps, and partial cubes (Q1422394) (← links)
- Counterexamples to the uniform shortest path routing conjecture for vertex-transitive graphs (Q1613354) (← links)
- Algorithm for recognizing Cartesian graph bundles (Q1613382) (← links)
- Behzad-Vizing conjecture and Cartesian-product graphs (Q1614125) (← links)
- On Cartesian product of Euclidean distance matrices (Q1629838) (← links)
- Graphical Frobenius representations (Q1631386) (← links)
- Generalized Hamming graphs: some new results (Q1649899) (← links)
- Products of compartmental models in epidemiology (Q1664518) (← links)
- Topological efficiency under graph operations (Q1676969) (← links)
- The hyper-Zagreb index and some graph operations (Q1676988) (← links)
- On two generalized connectivities of graphs (Q1692646) (← links)
- On the (adjacency) metric dimension of corona and strong product graphs and their local variants: combinatorial and computational results (Q1693144) (← links)
- Strong resolving graphs: the realization and the characterization problems (Q1693153) (← links)
- Graph products and characterization by rings (Q1694974) (← links)
- The eccentric weight of graphs (Q1698499) (← links)
- On linkedness in the Cartesian product of graphs (Q1701356) (← links)
- The journey of graph kernels through two decades (Q1706611) (← links)
- Gromov hyperbolicity in lexicographic product graphs (Q1713070) (← links)
- Independence number of products of Kneser graphs (Q1727773) (← links)
- Epistatic arithmetic crossover based on Cartesian graph product in ensemble differential evolution (Q1733413) (← links)
- Boundary vertices of Cartesian product of directed graphs (Q1738686) (← links)
- \(L(2,1)\)-labeling of direct product of paths and cycles (Q1764815) (← links)
- Burning number of graph products (Q1784749) (← links)
- Secure total domination in graphs: bounds and complexity (Q1786876) (← links)
- Reformulated reciprocal degree distance of graph operations (Q1788317) (← links)
- On subgraphs of Cartesian product graphs and S-primeness (Q1827726) (← links)
- Products of circulant graphs are metacirculant. (Q1850608) (← links)
- A min-max result on catacondensed benzenoid graphs (Q1861757) (← links)
- Intersection graphs of maximal hypercubes (Q1867285) (← links)
- Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians (Q1883410) (← links)
- A channel assignment problem for optical networks modelled by Cayley graphs (Q1884990) (← links)
- On \(k\)-pairable graphs (Q1886336) (← links)
- Graph Laplacians, nodal domains, and hyperplane arrangements (Q1886532) (← links)
- The 2-edge geodetic number and graph operations (Q1925613) (← links)
- On edge connectivity of direct products of graphs (Q1944162) (← links)
- On the complexity of recognizing \(S\)-composite and \(S\)-prime graphs (Q1949105) (← links)
- Dilation coefficient, plane-width, and resolution coefficient of graphs (Q1950340) (← links)
- Canonical forms for symmetric and regular structures (Q1951169) (← links)
- Graph products and its applications in mathematical formulation of structures (Q1952875) (← links)
- Some results on the target set selection problem (Q1956258) (← links)
- Connectivity of strong products of graphs (Q1959713) (← links)
- Extremal bicyclic graphs with respect to Mostar index (Q2009381) (← links)
- Note on group distance magic graphs \(G[C_4]\) (Q2014708) (← links)
- The construction of a smallest unstable asymmetric graph and a family of unstable asymmetric graphs with an arbitrarily high index of instability (Q2026324) (← links)
- The sigma coindex of graph operations (Q2036071) (← links)
- On graphs all of whose total dominating sequences have the same length (Q2037571) (← links)
- A vulnerability parameter of networks (Q2037692) (← links)
- On the 2-packing differential of a graph (Q2044595) (← links)
