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)
- On median nature and enumerative properties of Fibonacci-like cubes
- The antistrong property for special digraph families
- Eccentricity, center and radius computations on the cover graphs of distributive lattices with applications to stable matchings
- Global cycle properties in graphs with large minimum clustering coefficient
- ON THE CORONA PRODUCT OF MONOGENIC SEMIGROUP GRAPHS
- SOME PROPERTIES ON THE DISJUNCTIVE PRODUCT OVER GRAPHS OF MONOGENIC SEMIGROUPS
- Title not available (Why is that?)
- Some results on the reciprocal sum-degree distance of graphs
- 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
- Strong products of hypergraphs: unique prime factorization theorems and algorithms
- State transfer on graphs
- On edge connectivity of direct products of graphs
- Distance magic graphs \(G \times C_n\)
- Adjacency preservers, symmetric matrices, and cores
- Perfect codes in direct products of cycles
- Title not available (Why is that?)
- Distance magic labeling and two products of graphs
- Note on distance magic products \(G\circ C_4\)
- On the common neighborhood graphs
- Characterization of the hyperbolicity in the lexicographic product
- Gromov hyperbolicity in strong product graphs
- On the strong metric dimension of Cartesian and direct products of graphs
- A survey of selected recent results on total domination in graphs
- On the super connectivity of Kronecker products of graphs
- A note on adjacency preservers on Hermitian matrices over finite fields
- \(y\)-Wiener index of composite graphs
- On the eccentric distance sum of graphs
- The bipartite edge frustration of composite graphs
- On \(\Sigma\) and \(\Sigma'\) labelled graphs
- The first and second Zagreb indices of some graph operations
- Transitive, locally finite median graphs with finite blocks
- Partial cubes are distance graphs
- Some new results on distance-based graph invariants
- The pre-hull number and lexicographic product
- None of the coronoid systems can be isometrically embedded into a hypercube
- Vertex vulnerability parameters of Kronecker products of complete graphs
- A note on the connectivity of Kronecker products of graphs
- Cubic inflation, mirror graphs, regular maps, and partial cubes
- Handbook of product graphs
- The Zagreb coindices of graph operations
- Generalizations of Wiener polarity index and terminal Wiener index
- On the geodetic and the hull numbers in strong product graphs
- On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
- Some results on the target set selection problem
- Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers
- Uniquely pairable graphs
- The packing chromatic number of infinite product graphs
- Adaptable chromatic number of graph products
- Graph products and characterization by rings
- Gromov hyperbolicity in lexicographic product graphs
- Mobility of vertex-transitive graphs
- Note on three table Oberwolfach problem
- Equistable graphs, general partition graphs, triangle graphs, and graph products
- Some inequalities for the atom-Bond connectivity index of graph operations
- \(L(2,1)\)-labeling of direct product of paths and cycles
- On minimum rank and zero forcing sets of a graph
- Lower bounds for the domination number and the total domination number of direct product graphs
- \(L(2,1)\)-labeling of strong products of cycles
- Reciprocal degree distance of product graphs
- Proofs of two conjectures on generalized Fibonacci cubes
- Generalized Hamming graphs: some new results
- On oriented graphs whose skew spectral radii do not exceed 2
- Wiener and vertex \(PI\) indices of Kronecker products of graphs
- Sharp upper bounds for generalized edge-connectivity of product graphs
- Topics in graph theory. Graphs and their Cartesian product
- Equitable colorings of Cartesian products of graphs
- On some topological indices of the tensor products of graphs
- The journey of graph kernels through two decades
- Tree-like partial Hamming graphs
- Computing the eccentric-distance sum for graph operations
- Another aspect of graph invariants depending on the path metric and an application in nanoscience
- A combinatorial approach to nonlocality and contextuality
- Independence and coloring properties of direct products of some vertex-transitive graphs
- Perfect codes in direct products of cycles-a complete characterization
- The PI index of product graphs
- Decomposing oriented graphs into six locally irregular oriented graphs
- A matrix method for computing Szeged and vertex PI indices of join and composition of graphs
- The hyper-Wiener index of graph operations
- Rainbow connection number of graph power and graph products
- On wreathed lexicographic products of graphs
- On the canonical metric representation, average distance, and partial Hamming graphs
- Connectivity of Cartesian products of graphs
- On topological relaxations of chromatic conjectures
- On two generalized connectivities of graphs
- On optimizing edge connectivity of product graphs
- On distance-balanced graphs
- The graph matching problem
- On the (adjacency) metric dimension of corona and strong product graphs and their local variants: combinatorial and computational results
- Fast recognition of Fibonacci cubes
- 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
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)
