scientific article; zbMATH DE number 1550912
From MaRDI portal
Publication:4523707
zbMATH Open0963.05002MaRDI QIDQ4523707FDOQ4523707
Authors: Wilfried Imrich, Sandi Klavžar 
Publication date: 14 January 2001
Title of this publication is not available (Why is that?)
Recommendations
Cited In (only showing first 100 items - show all)
- Degree-based topological indices of double graphs and strong double graphs
- Fast recognition algorithms for classes of partial cubes
- Hedetniemi's conjecture and adjoint functors in thin categories
- Products of circulant graphs are metacirculant.
- On the super domination number of lexicographic product graphs
- On the weak Roman domination number of lexicographic product graphs
- Thinness of product graphs
- The 2-domination number of cylindrical graphs
- Diagonalized Cartesian products of \(S\)-prime graphs are \(S\)-prime
- Hypercellular graphs: partial cubes without \(Q_3^-\) as partial cube minor
- The median function on graphs with bounded profiles
- Cycle frames and the Oberwolfach problem
- All good (bad) words consisting of 5 blocks
- On prisms, Möbius ladders and the cycle space of dense graphs
- PI polynomials of product graphs
- Minimum cycle bases of direct products of complete graphs
- On the remoteness function in median graphs
- Corona graphs as a model of small-world networks
- On \(k\)-pairable regular graphs
- Boundary vertices of Cartesian product of directed graphs
- Distinguishing chromatic numbers of complements of Cartesian products of complete graphs
- Cube intersection concepts in median graphs
- On subgraphs of Cartesian product graphs and S-primeness
- Title not available (Why is that?)
- Bounds for the pebbling number of product graphs
- Title not available (Why is that?)
- The distinguishing chromatic number of Cartesian products of two complete graphs
- On the eccentric complexity of graphs
- Lower bounds for treewidth of product graphs
- On \(k\)-pairable graphs
- Graph kernels and Gaussian processes for relational reinforcement learning
- On prime inductive classes of graphs
- Hypercube embeddings and Cayley graphs generated by transpositions
- Total coloring conjecture on certain classes of product graphs
- Mutually embeddable graphs and the tree alternative conjecture
- The optimal strong radius and optimal strong diameter of the Cartesian product graphs
- Weak sense of direction labelings and graph embeddings
- Products of geodesic graphs and the geodetic number of products
- Lattice embeddings of trees
- Weak k-reconstruction of cartesian product graphs
- Double domination in lexicographic product graphs
- A channel assignment problem for optical networks modelled by Cayley graphs
- Vizing's conjecture for chordal graphs
- On the geodetic number of median graphs
- Hyper- and reverse-Wiener indices of F-sums of graphs
- On eigenvalues of the reciprocal distance signless Laplacian matrix of graphs
- Chromatic numbers of the strong product of odd cycles
- Recognizing triangulated Cartesian graph products
- On idomatic partitions of direct products of complete graphs
- A note on Hedetniemi's conjecture, Stahl's conjecture and the Poljak-Rödl function
- Burning number of graph products
- Counting hypercubes in hypercubes
- Fast recognition of classes of almost-median graphs
- On cube-free median graphs
- Characterizing almost-median graphs
- Hamming polynomials and their partial derivatives
- Characterizing flag graphs and incuced subgraphs of Cartesian product graphs
- Netlike partial cubes II. Retracts and netlike subgraphs
- Proof of a conjecture concerning the direct product of bipartite graphs
- Strongly distance-balanced graphs and graph products
- Extremal bicyclic graphs with respect to Mostar index
- A theorem on Wiener-type invariants for isometric subgraphs of hypercubes
- Independence number of products of Kneser graphs
- Intersection graphs of maximal hypercubes
- Distance-balanced graphs: symmetry conditions
- A general lower bound for the domination number of cylindrical graphs
- Constructing uniquely realizable graphs
- Optimal acyclic edge colouring of grid like graphs
- A local prime factor decomposition algorithm
- Computing median and antimedian sets in median graphs
- Quasi-independence, homology and the unity of type: a topological theory of characters
- A characterization of non-isometric binary words
- The fault-diameter of Cartesian products
- Two-ended regular median graphs
- Equitable colorings of Kronecker products of graphs
- Recognizing Cartesian products in linear time
- On direct product cancellation of graphs
- First and second extremal bipartite graphs with respect to PI index
- Isometric embedding of subdivided Connected graphs in the hypercube
- Isometric embeddings of subdivided complete graphs in the hypercube
- Approximate graph products
- Cage-amalgamation graphs, a common generalization of chordal and median graphs
- Treewidth and logical definability of graph products
- Multiple Kronecker covering graphs
- Products of unit distance graphs
- On the geodetic number and related metric sets in Cartesian product graphs
- Generalized symmetry of graphs - a survey
- \(\Theta\)-graceful labelings of partial cubes
- The \(t\)-median function on graphs
- Algorithm for recognizing Cartesian graph bundles
- Connectivity of strong products of graphs
- Orthogonal drawings and crossing numbers of the Kronecker product of two cycles
- An oriented version of the 1-2-3 conjecture
- The algebra of metric betweenness. I: Subdirect representation and retraction
- On the roman domination in the lexicographic product of graphs
- Fault-diameter of Cartesian graph bundles
- The third and hyper-Zagreb coindices of some graph operations
- Embeddability of open-ended carbon nanotubes in hypercubes
- Perfect \(r\)-domination in the Kronecker product of two cycles, with an application to diagonal/toroidal mesh
- Note on group distance magic graphs \(G[C_4]\)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4523707)
