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)
- A magic rectangle set on abelian groups and its application
- Comparison between Merrifield-Simmons index and Wiener index of graphs
- Lexicographic metric spaces: Basic properties and the metric dimension
- Group distance magic Cartesian product of two cycles
- Solution of the Chen-Chvátal conjecture for specific classes of metric spaces
- Automorphisms group of generalized Hamming Graphs
- Further results on non-self-centrality measures of graphs
- Between the enhanced power graph and the commuting graph
- A note on topological indices and coindices of disjunction and symmetric difference of graphs
- Group distance magic and antimagic hypercubes
- A novel graph invariant: The third leap Zagreb index under several graph operations
- Geodesies in Fuzzy Graphs
- Resource convertibility and ordered commutative monoids
- On the metric representation of the vertices of a graph
- On the edge-Wiener index of the disjunctive product of simple graphs
- The construction of a smallest unstable asymmetric graph and a family of unstable asymmetric graphs with an arbitrarily high index of instability
- Splines and wavelets on circulant graphs
- Equitable distinguishing chromatic number
- The sigma coindex of graph operations
- A vulnerability parameter of networks
- On graphs all of whose total dominating sequences have the same length
- On the 2-packing differential of a graph
- Protection of lexicographic product graphs
- Fibonacci-run graphs. I: Basic properties
- Optimal wirelength of balanced complete multipartite graphs onto Cartesian product of \{path, cycle\} and trees
- Crossing graphs of fiber-complemented graphs
- Symmetry and two symmetry measures for the web and spider web graphs
- On WL-rank and WL-dimension of some Deza circulant graphs
- Combinatorial generation via permutation languages. II. Lattice congruences
- The first general Zagreb coindex of graph operations
- The weight distribution of irreducible cyclic codes associated with decomposable generalized Paley graphs
- Extendability and criticality in matching theory
- 3-tuple total domination number of Rook's graphs
- Some bounds for total communicability of graphs
- \(l_1\)-embeddability of generic quadrilateral Möbius maps
- The energy of a simplicial complex
- Group distance magic and antimagic graphs
- Riordan graphs I: structural properties
- Enumerative properties and cube polynomials of Tribonacci cubes
- Spectra of graphs resulting from various graph operations and products: a survey
- Closed formulas for the total Roman domination number of lexicographic product graphs
- A graph theoretic approach to construct desired cryptographic Boolean functions
- The arc-types of Cayley graphs
- Computation and algorithm for the minimum \(k\)-edge-connectivity of graphs
- The simultaneous local metric dimension of graph families
- Cops that surround a robber
- Pell graphs
- Protection of graphs with emphasis on Cartesian product graphs
- Modular decomposition of graphs and the distance preserving property
- A note on pebbling bound for a product of class 0 graphs
- On partial cubes, well-graded families and their duals with some applications in graphs
- 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
- 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
- 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
- Some properties on the disjunctive product over graphs of monogenic semigroups
- On the corona product of monogenic semigroup 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)
