Boolean Operations on Graphs.

Cited in

(27)

A note on asymmetric graphs
Products of circulant graphs are metacirculant.
Combinatorial verification of the elementary divisors of tensor products
scientific article; zbMATH DE number 7589550 (Why is no real title available?)
A note on acyclic coloring of strong product of graphs
Edge incident 2-edge coloring of graphs
On the genus of the tensor product of graphs where one factor is a regular graph
Graph products with specified domains for configuration processing and formation of the adjacency matrices
Solution to a conjecture on resistance diameter of lexicographic product of paths
\(\mathcal Q\)-Ramsey classes of graphs
Analysis of space truss towers using combined symmetry groups and product graphs
An efficient analysis of repetitive structures generated by graph products
On the resistance diameter of the Cartesian and lexicographic product of paths
Associative products of graphs
Vertex neighborhood restricted edge achromatic sums of graphs
NEPS operations on cordial graphs
Spectra and Laplacian spectra of arbitrary powers of lexicographic products of graphs
Generalized hypercube graph \(\mathcal{Q}_n(S)\), graph products and self-orthogonal codes
Digraphs with real and Gaussian spectra
Numerical invariants and the strong product of graphs
scientific article; zbMATH DE number 907922 (Why is no real title available?)
A new concept of primeness in graphs
Factorization for efficient solution of eigenproblems of adjacency and Laplacian matrices for graph products
On the minimum energy of regular graphs
Solving string problems on graphs using the labeled direct product
Wang tilings and distributed verification on anonymous torus networks
Cutpoints in the conjunction of two graphs

This page was built for publication: Boolean Operations on Graphs.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5531678)