Handbook of product graphs
From MaRDI portal
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Structural characterization of families of graphs (05C75) Graph operations (line graphs, products, etc.) (05C76) Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10)
Recommendations
Cited in
(only showing first 100 items - show all)- A class of highly symmetric graphs, symmetric cylindrical constructions and their spectra
- The fractional strong metric dimension in three graph products
- A prime factor theorem for bipartite graphs
- On the \(P_3\)-hull number of some products of graphs
- Embeddability into relational lattices is undecidable
- Structural properties of resonance graphs of plane elementary bipartite graphs
- The diameter of strong orientations of Cartesian products of graphs
- Enumerating graphs via even/odd dichotomy
- Unification of graph products and compatibility with switching
- Constant sum partition of sets of integers and distance magic graphs
- On two generalized connectivities of graphs
- Bounding the open \(k\)-monopoly number of strong product graphs
- Strong resolving graphs: the realization and the characterization problems
- Cartesian product-based hierarchical scheme for multi-agent systems
- (d, n)-packing colorings of infinite lattices
- COMs: complexes of oriented matroids
- Cartesian products of directed graphs with loops
- Toll number of the strong product of graphs
- Proper connection number of graph products
- Infinite families of circular and Möbius ladders that are total domination game critical
- On 3-colorings of direct products of graphs
- On some characterizations of antipodal partial cubes
- Orientable \(\mathbb{Z}_N\)-distance magic graphs
- Matching preclusion number in product graphs
- The edge-Wiener index and the edge-hyper-Wiener index of phenylenes
- A heuristic approach for searching \((d, n)\)-packing colorings of infinite lattices
- A characterization of the resonance graph of an outerplane bipartite graph
- Gromov hyperbolicity in the Cartesian sum of graphs
- Decompositions of graphs based on a new graph product
- Constructing edge-disjoint Steiner paths in lexicographic product networks
- The Szeged index and the Wiener index of partial cubes with applications to chemical graphs
- Average distance is submultiplicative and subadditive with respect to the strong product of graphs
- Graph transformations for efficient structural analysis
- Total colorings of product graphs
- Steiner convex sets and Cartesian product
- Constructing almost peripheral and almost self-centered graphs revisited
- The median game
- Grundy dominating sequences and zero forcing sets
- Efficient eight-regular circulants based on the Kronecker product
- Vertex-transitive direct products of graphs
- Cover-encodings of fitness landscapes
- A survey on hypergraph products
- On the complexity of recognizing S-composite and S-prime graphs
- A smaller extended formulation for the odd cycle inequalities of the stable set polytope
- Edge metric dimension of some graph operations
- Direct product primality testing of graphs is GI-hard
- Distribution of global defensive \(k\)-alliances over some graph products
- The threshold dimension of a graph
- Complexity of \(k\)-rainbow independent domination and some results on the lexicographic product of graphs
- Modeling the packing coloring problem of graphs
- Toll number of the Cartesian and the lexicographic product of graphs
- Finite edge-transitive oriented graphs of valency four with cyclic normal quotients
- Rainbow connection and graph products
- Some results about the reliability of folded hypercubes
- Asymmetric colorings of products of graphs and digraphs
- On extendability of co-edge-regular graphs
- The threshold strong dimension of a graph
- Tightness of domination inequalities for direct product graphs
- The cost of 2-distinguishing hypercubes
- On automorphisms of direct products of Cayley graphs on abelian groups
- An explicit characterization of arc-transitive circulants
- On antipodal and diametrical partial cubes
- On the 2-packing differential of a graph
- Maker-breaker resolving game
- Eccentric connectivity coindex under graph operations
- The antistrong property for special digraph families
- Protection of lexicographic product graphs
- Linear k-arboricity of Caylay graphs on abelian groups with given degree
- A note on maximum fractional matchings of graphs
- Fibonacci and Lucas \(p\)-cubes
- On zero-error codes produced by greedy algorithms
- A reduction formula for Waring numbers through generalized Paley graphs
- The edge general position problem
- On well-dominated direct, Cartesian and strong product graphs
- Characterization of 2-arc-transitive partial cubes
- On the mutual visibility in Cartesian products and triangle-free graphs
- Further results on 2-distance coloring of graphs
- Complexity of local, global and universality properties in finite dynamical systems
- Discrete density comonads and graph parameters
- The radius and center of Fibonacci-run graphs
- Orientable domination in product-like graphs
- Normal Cayley digraphs of generalized quaternion groups with CI-property
- Medians in median graphs and their cube complexes in linear time
- Colouring simplicial complexes via the Lechuga-Murillo's model
- Solution of the Chen-Chvátal conjecture for specific classes of metric spaces
- Values and bounds for depth and Stanley depth of some classes of edge ideals
- Identifying codes in the complementary prism of cycles
- On maximum intersecting sets in direct and wreath product of groups
- Geodesic transversal problem for join and lexicographic product of graphs
- Relating the outer-independent total Roman domination number with some classical parameters of graphs
- The commuting graph of the cyclic extension of an abelian group
- The general position achievement game played on graphs
- The H-join of arbitrary families of graphs -- the universal adjacency spectrum
- Szeged-like entropies of graphs
- On some properties of antipodal partial cubes
- The energy of a simplicial complex
- The watching system as a generalization of identifying code
- Two infinite families of critical clique-Helly graphs
- On bicliques and the second clique graph of suspensions
- On the P₃-hull number of Hamming graphs
This page was built for publication: Handbook of product graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3005852)
