scientific article; zbMATH DE number 1550912
From MaRDI portal
Publication:4523707
zbMath0963.05002MaRDI QIDQ4523707
Sandi Klavžar, Wilfried Imrich
Publication date: 14 January 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (only showing first 100 items - show all)
Eccentricity, center and radius computations on the cover graphs of distributive lattices with applications to stable matchings ⋮ Adjacency preservers on invertible Hermitian matrices. I. ⋮ Some properties on the tensor product of graphs obtained by monogenic semigroups ⋮ Sharp lower bounds on the Narumi-Katayama index of graph operations ⋮ On the common neighborhood graphs ⋮ Characterization of the hyperbolicity in the lexicographic product ⋮ Thinness of product graphs ⋮ Edge, vertex and mixed fault diameters ⋮ A note on adjacency preservers on Hermitian matrices over finite fields ⋮ Fault-diameter of Cartesian graph bundles ⋮ Minimum cycle bases of direct products of complete graphs ⋮ Note on three table Oberwolfach problem ⋮ Cartesian powers of graphs can be distinguished by two labels ⋮ Hamilton cycles in digraphs of unitary matrices ⋮ The \(t\)-median function on graphs ⋮ Sharp upper bounds for generalized edge-connectivity of product graphs ⋮ Mutually embeddable graphs and the tree alternative conjecture ⋮ Counting hypercubes in hypercubes ⋮ Decomposing oriented graphs into six locally irregular oriented graphs ⋮ On cube-free median graphs ⋮ Fast recognition of classes of almost-median graphs ⋮ Recognizing Cartesian products in linear time ⋮ Mobility of vertex-transitive graphs ⋮ Weak reconstruction of strong product graphs ⋮ An almost complete description of perfect codes in direct products of cycles ⋮ Gridline indifference graphs ⋮ Characterizing almost-median graphs ⋮ Generalizations of Wiener polarity index and terminal Wiener index ⋮ Partial cubes and their \(\tau\)-graphs ⋮ Hamming polynomials and their partial derivatives ⋮ The Zagreb coindices of graph operations ⋮ Equitable colorings of Kronecker products of graphs ⋮ Wiener and vertex \(PI\) indices of Kronecker products of graphs ⋮ Maximal proper subgraphs of median graphs ⋮ The bipartite edge frustration of composite graphs ⋮ The property of \(k\)-colourable graphs is uniquely decomposable ⋮ \(L(2,1)\)-labelings on the modular product of two graphs ⋮ A combinatorial development of Fibonacci numbers in graph spectra ⋮ Upper bounds on sets of orthogonal colorings of graphs ⋮ Constructing uniquely realizable graphs ⋮ Gromov hyperbolicity in strong product graphs ⋮ On the strong metric dimension of Cartesian and direct products of graphs ⋮ Distance magic graphs \(G \times C_n\) ⋮ Another aspect of graph invariants depending on the path metric and an application in nanoscience ⋮ First and second extremal bipartite graphs with respect to PI index ⋮ Edge-clique covers of the tensor product ⋮ On optimizing edge connectivity of product graphs ⋮ The optimal strong radius and optimal strong diameter of the Cartesian product graphs ⋮ Weak sense of direction labelings and graph embeddings ⋮ On the geodetic and the hull numbers in strong product graphs ⋮ Adjacency preservers, symmetric matrices, and cores ⋮ The pre-hull number and lexicographic product ⋮ Products of digraphs and their competition graphs ⋮ Orthogonal drawings and crossing numbers of the Kronecker product of two cycles ⋮ On the super connectivity of Kronecker products of graphs ⋮ On the roman domination in the lexicographic product of graphs ⋮ Visualization of quasi-median networks ⋮ On prime inductive classes of graphs ⋮ Semi-Cartesian product of graphs ⋮ On embeddings of CAT(0) cube complexes into products of trees via colouring their hyperplanes ⋮ Multiple Kronecker covering graphs ⋮ Approximate eigensolution of Laplacian matrices for locally modified graph products ⋮ The PI index of product graphs ⋮ Diagonalized Cartesian products of \(S\)-prime graphs are \(S\)-prime ⋮ State transfer on graphs ⋮ Recognizing triangulated Cartesian graph products ⋮ On idomatic partitions of direct products of complete graphs ⋮ Connectivity of Kronecker products by \(K_2\) ⋮ Perfect codes in direct products of cycles-a complete characterization ⋮ Computing the blocks of a quasi-median graph ⋮ Reciprocal degree distance of product graphs ⋮ Homogeneous factorisations of graph products ⋮ On the Cartesian skeleton and the factorization of the strong product of digraphs ⋮ Rainbow connection number of graph power and graph products ⋮ On the geodetic number of median graphs ⋮ On the upper total domination number of Cartesian products of graphs ⋮ Note on distance magic products \(G\circ C_4\) ⋮ Distance magic labeling and two products of graphs ⋮ Some results on the reciprocal sum-degree distance of graphs ⋮ Proofs of two conjectures on generalized Fibonacci cubes ⋮ Characterization of reducible hexagons and fast decomposition of elementary benzenoid graphs ⋮ None of the coronoid systems can be isometrically embedded into a hypercube ⋮ Matching extension in prism graphs ⋮ Note on terminal-pairability in complete grid graphs ⋮ Hedetniemi's conjecture and adjoint functors in thin categories ⋮ The behavior of clique-width under graph operations and graph transformations ⋮ \(1\)-perfectly orientable graphs and graph products ⋮ \(y\)-Wiener index of composite graphs ⋮ A local prime factor decomposition algorithm ⋮ On the eccentric distance sum of graphs ⋮ Optimal acyclic edge colouring of grid like graphs ⋮ On topological relaxations of chromatic conjectures ⋮ Lower bounds for the domination number and the total domination number of direct product graphs ⋮ On \(k\)-pairable regular graphs ⋮ Distinguishing chromatic numbers of complements of Cartesian products of complete graphs ⋮ On path-pairability in the Cartesian product of graphs ⋮ Lower bounds for treewidth of product graphs ⋮ Equitable colorings of Cartesian products of graphs ⋮ On some topological indices of the tensor products of graphs ⋮ Double domination in lexicographic product graphs
This page was built for publication:
