[图书][B] Handbook of product graphs

RH Hammack, W Imrich, S Klavžar, W Imrich, S Klavžar - 2011 - api.taylorfrancis.com
Every branch of mathematics employs some notion of a product that enables the com-
bination or decomposition of its elemental structures. In graph theory there are four main …

Spectra and the exact number of Automorphisms of Paley-type graphs of order a product of'n'distinct primes

A Sivaranjani, S Radha - arXiv preprint arXiv:2310.04137, 2023 - arxiv.org
Paley graphs are Cayley graphs which are circulant and strongly regular. Paley-type graph
of order a product of two distinct Pythagorean primes was introduced by Dr Angsuman Das …

[PDF][PDF] Local prime factor decomposition of approximate strong product graphs

M Hellmuth - 2010 - d-nb.info
In practice, graphs often occur as perturbed product structures, so-called approximate graph
products. The practical application of the well-known prime factorization algorithms is …

Reliability of networks modelled by graph products

RM Casablanca - 2014 - dialnet.unirioja.es
A general purpose in Graph Theory is to describe any graph structure and provide all the
information about it as possible. The study of invariants, properties and graph families of …

[PDF][PDF] Minimum cycle bases of lexicographic products.

M Hellmuth, PJ Ostermeier, PF Stadler - Ars Math. Contemp., 2012 - academia.edu
Minimum cycle bases of product graphs can in most situations be constructed from minimum
cycle bases of the factors together with a suitable collection of triangles and/or quadrangles …

On the basis number of the wreath product of paths with wheels and some related problems

MMM Jaradat, MS Bataineh, MK Al-Qeyyam - 2017 - qspace.qu.edu.qa
On the basis number of the wreath product of paths with wheels and some related problems
English العربية Toggle navigation العربية Login QU QU Library Toggle navigation Home …

[PDF][PDF] Approximate Strong Product Graphs A New Local Prime Factor Decomposition Algorithm

M Hellmutha - academia.edu
This work is concerned with the prime factor decomposition (PFD) of strong product graphs.
In practice, graphs often occur as perturbed product structures, so-called approximate graph …

[引用][C] Reliability of networks modelled by graph products