Topics in graph theory. Graphs and their Cartesian product
From MaRDI portal
Recommendations
Cited in
(92)- On the stability of the Cartesian product of a neural ring and an arbitrary neural network
- On two generalized connectivities of graphs
- Partition distance in graphs
- Algorithm to find a maximum 2-packing set in a cactus
- On the complexity of recognizing S-composite and S-prime graphs
- Structure of Fibonacci cubes: a survey
- Strong geodetic number of complete bipartite graphs, crown graphs and hypercubes
- On general position sets in Cartesian products
- On the isometric path partition problem
- The general position problem on Kneser graphs and on some graph operations
- On the treewidth of Hanoi graphs
- Connected domination game played on Cartesian products
- Strong edge coloring of Cayley graphs and some product graphs
- Embedding grid graphs on surfaces
- Generalized adjacency and Laplacian spectra of the weighted corona graphs
- Extendability and criticality in matching theory
- On the fold thickness of graphs
- The general position number of Cartesian products involving a factor with small diameter
- Adjacency on the order polytope with applications to the theory of fuzzy measures
- A lower bound and several exact results on the \(d\)-lucky number
- Strong geodetic cores and Cartesian product graphs
- Lattices from tight frames and vertex transitive graphs
- Spectra of graphs resulting from various graph operations and products: a survey
- On the ensemble of optimal dominating and locating-dominating codes in a graph
- Intervals and convex sets in strong product of graphs
- On constructing normal and non-normal Cayley graphs
- On minimum identifying codes in some Cartesian product graphs
- A sharp lower bound for the generalized 3-edge-connectivity of strong product graphs
- Betweenness centrality in Cartesian product of graphs
- Fibonacci \((p,r)\)-cubes as Cartesian products
- The general position number of integer lattices
- Maximum induced forests of product graphs
- Products of distance degree regular and distance degree injective graphs
- Improved upper bounds on the domination number of graphs with minimum degree at least five
- Handbook of product graphs
- Recent developments on the structure of Cartesian products of graphs
- A note on edge-connectivity of the Cartesian product of graphs
- Digraphs products
- Sharp upper bounds for generalized edge-connectivity of product graphs
- Sierpiński graphs as spanning subgraphs of Hanoi graphs
- Coloring Hanoi and Sierpiński graphs
- Determinants of box products of paths
- scientific article; zbMATH DE number 1550912 (Why is no real title available?)
- On Cartesian product of vertex measurable graphs
- Invertibility of graph translation and support of Laplacian Fiedler vectors
- Steiner Wiener index of block graphs
- On Cartesian products having a minimum dominating set that is a box or a stairway
- The general position number of the Cartesian product of two trees
- General d-position sets
- On clique convergence of graphs
- Results on Total Restrained Domination number and subdivision number for certain graphs
- Distance degree graphs in the Cartesian product of graphs
- Minimum linear arrangement of the Cartesian product of optimal order graph and path
- Matching extension in prism graphs
- Betweenness centrality in Cartesian product of graphs
- A survey and classification of Sierpiński-type graphs
- On color-preserving automorphisms of Cayley graphs of odd square-free order
- Semigroups generated by partitions
- A local prime factor decomposition algorithm
- The diameter variability of the Cartesian product of graphs
- Restrained geodetic domination in graphs
- scientific article; zbMATH DE number 7589571 (Why is no real title available?)
- Global vertex-edge domination sets in total graph and product graph of path \(P_n\) cycle \(C_n\)
- A textbook of graph theory
- Strong triadic closure in cographs and graphs of low maximum degree
- Shifting paths to avoidable ones
- Domination in digraphs and their direct and Cartesian products
- CONFIGURATIONS OF HIGHER ORDERS
- Total domination dot-critical graphs
- Cartesian product of synchronization transitions and hysteresis
- On the domination number and the 2-packing number of Fibonacci cubes and Lucas cubes
- Mutual-visibility problems on graphs of diameter two
- Diagonalized Cartesian products of \(S\)-prime graphs are \(S\)-prime
- Regular embeddings of Cartesian product graphs
- Monitoring the edges of product networks using distances
- The d-distance p-packing domination number: complexity, cycles, and trees
- A note on Cayley nut graphs whose degree is divisible by four
- Nut graphs with a prescribed number of vertex and edge orbits
- Lower general position in Cartesian products
- Lower general position sets in graphs
- Graphs with total mutual-visibility number zero and total mutual-visibility in Cartesian products
- Strong subgraph 2-arc-connectivity and arc-strong connectivity of Cartesian product of digraphs
- Generalization of edge general position problem
- Strong geodetic problem in grid-like architectures
- The isomorphism problem of power graphs and a question of Cameron
- Exact dominion of the prism graph: enumeration by congruence class via cyclic words
- On the expansion of Hanoi graphs
- The \(b\)-chromatic index of a graph
- Thinness of product graphs
- Vizing's conjecture for graphs with domination number 3 -- a new proof
- Dependence polynomials of some graph operations
- Domination criticality in product graphs
This page was built for publication: Topics in graph theory. Graphs and their Cartesian product
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5302113)
