Boolean Operations on Graphs.

DOI10.7146/math.scand.a-10817zbMath0152.22801OpenAlexW2530883068MaRDI QIDQ5531678

G. W. Wilcox, Frank Harary

Publication date: 1967

Published in: MATHEMATICA SCANDINAVICA (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/165977

zbMATH Keywords

topology

Related Items (25)

Combinatorial verification of the elementary divisors of tensor products ⋮ On the genus of the tensor product of graphs where one factor is a regular graph ⋮ On the resistance diameter of the Cartesian and lexicographic product of paths ⋮ Spectra and Laplacian spectra of arbitrary powers of lexicographic products of graphs ⋮ Unnamed Item ⋮ Vertex neighborhood restricted edge achromatic sums of graphs ⋮ Digraphs with real and Gaussian spectra ⋮ Unnamed Item ⋮ Solution to a conjecture on resistance diameter of lexicographic product of paths ⋮ Analysis of space truss towers using combined symmetry groups and product graphs ⋮ Wang tilings and distributed verification on anonymous torus networks ⋮ Graph products with specified domains for configuration processing and formation of the adjacency matrices ⋮ \(\mathcal Q\)-Ramsey classes of graphs ⋮ Factorization for efficient solution of eigenproblems of adjacency and Laplacian matrices for graph products ⋮ Associative products of graphs ⋮ On the minimum energy of regular graphs ⋮ An efficient analysis of repetitive structures generated by graph products ⋮ Cutpoints in the conjunction of two graphs ⋮ NEPS operations on cordial graphs ⋮ A note on asymmetric graphs ⋮ Numerical invariants and the strong product of graphs ⋮ A new concept of primeness in graphs ⋮ Unnamed Item ⋮ Solving string problems on graphs using the labeled direct product ⋮ Products of circulant graphs are metacirculant.

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