scientific article

Wilfried Imrich, Sandi Klavžar, Richard H. Hammack

Publication date: 10 June 2011

Full work available at URL: http://www.crcnetbase.com/isbn/9781439813058

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Graph operations (line graphs, products, etc.) (05C76)

Related Items (only showing first 100 items - show all)

CAYLEY–ABELS GRAPHS AND INVARIANTS OF TOTALLY DISCONNECTED, LOCALLY COMPACT GROUPS ⋮ Distance formula for direct-co-direct product in the case of disconnected factors ⋮ Different-Distance Sets in a Graph ⋮ Unnamed Item ⋮ Coefficient of domination in graph ⋮ On incidence coloring of graph fractional powers ⋮ Unnamed Item ⋮ Clique immersion in graph products ⋮ Induced subgraphs of product graphs and a generalization of Huang's theorem ⋮ On construction for trees making the equality hold in Vizing's conjecture ⋮ Normal Cayley digraphs of dihedral groups with CI-property ⋮ Generalized X-join of graphs and their automorphisms ⋮ Tensor products and strong products of soft graphs ⋮ On dominating graph of graphs, median graphs, partial cubes and complement of minimal dominating sets ⋮ A Heuristic for Direct Product Graph Decomposition ⋮ Automorphism group of 2-token graph of the Hamming graph ⋮ Wreath product in automorphism groups of graphs ⋮ Total mutual-visibility in graphs with emphasis on lexicographic and Cartesian products ⋮ Hypercube embeddings and Cayley graphs generated by transpositions ⋮ Geodesic packing in graphs ⋮ On some metric properties of direct-co-direct product ⋮ Unimodality and monotonic portions of certain domination polynomials ⋮ Smallest maximal matchings of graphs ⋮ From \(w\)-domination in graphs to domination parameters in lexicographic product graphs ⋮ Graphs whose mixed metric dimension is equal to their order ⋮ Edge general position sets in Fibonacci and Lucas cubes ⋮ The weight distribution of irreducible cyclic codes associated with decomposable generalized Paley graphs ⋮ Generalized Cut Method for Computing Szeged–Like Polynomials with Applications to Polyphenyls and Carbon Nanocones ⋮ Binary Coding of Resonance Graphs of Catacondensed Polyhexes ⋮ A graph product and its applications in generating non-cospectral equienergetic graphs ⋮ Special \textit{LCD} codes from products of graphs ⋮ Automorphisms of the double cover of a circulant graph of valency at most 7 ⋮ Graph isomorphism: physical resources, optimization models, and algebraic characterizations ⋮ Shallow Minors, Graph Products, and Beyond-Planar Graphs ⋮ The spectra of graphs based on general graph operations ⋮ Some conditions implying stability of graphs ⋮ The general position avoidance game and hardness of general position games ⋮ Subquadratic-time algorithm for the diameter and all eccentricities on median graphs ⋮ Optimal embeddings of the exchanged hypercube and the dual-cube as vertex-induced subgraphs of the hypercube ⋮ Distance antimagic labelings of product graphs ⋮ Unnamed Item ⋮ On the 2-rainbow independent domination numbers of some graphs ⋮ Resonance Graphs and a Binary Coding of Perfect Matchings of Outerplane Bipartite Graphs ⋮ Corners and simpliciality in oriented matroids and partial cubes ⋮ Resonance graphs on perfect matchings of graphs on surfaces ⋮ Robust Factorizations and Colorings of Tensor Graphs ⋮ First-order logic axiomatization of metric graph theory ⋮ Stability of graph pairs involving vertex-transitive graphs ⋮ NEPS of complex unit gain graphs ⋮ Unnamed Item ⋮ EDGE ITALIAN DOMINATION OF SOME GRAPH PRODUCTS ⋮ The security number of lexicographic products ⋮ Unnamed Item ⋮ Random Colourings and Automorphism Breaking in Locally Finite Graphs ⋮ A note on δ^(k)-colouring of the Cartesian product of some graphs ⋮ THE DIAMETER VARIABILITY OF THE CARTESIAN PRODUCT OF GRAPHS ⋮ DEGREE DISTANCE OF PRODUCT GRAPHS ⋮ Rainbow vertex-connection and graph products ⋮ Constructing Internally Disjoint Pendant Steiner Trees in Cartesian Product Networks ⋮ Strong resolving partitions for strong product graphs and Cartesian product graphs ⋮ Independence number of generalized products of graphs ⋮ Direct product of automorphism groups of digraphs ⋮ Unnamed Item ⋮ The Zero Divisor Graph of 2 × 2 Matrices Over a Field ⋮ Circular slider graphs: de Bruijn, Kautz, Rauzy, lamplighters and spiders ⋮ A novel graph invariant: The third leap Zagreb index under several graph operations ⋮ Fine-Grained Complexity of the Graph Homomorphism Problem for Bounded-Treewidth Graphs ⋮ Local colourings of Cartesian product graphs ⋮ Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs ⋮ Star coloring under some graph operations ⋮ 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_3\)-hull number of Hamming graphs ⋮ Generalized cut method for computing the edge-Wiener index ⋮ Improved upper bounds for identifying codes in \(n\)-dimensional \(q\)-ary cubes ⋮ Using semidirect products of groups to build classes of interconnection networks ⋮ Some properties of double Roman domination ⋮ Exact-2-relation graphs ⋮ Distinguishing density and the distinct spheres condition ⋮ A survey on hypergraph products ⋮ On the complexity of recognizing \(S\)-composite and \(S\)-prime graphs ⋮ Fractional matching preclusion of product networks ⋮ On the automorphism groups of connected bipartite irreducible graphs ⋮ On Grundy total domination number in product graphs ⋮ Graph exponentiation and neighborhood reconstruction

This page was built for publication: