Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

17

EJC
2008

favoriteEmaildiscussreport

163views Information Technology» more EJC 2008»

Multiple Kronecker covering graphs

13 years 4 months ago

Multiple Kronecker covering graphs

Download www.imrich.at

A graph may be the Kronecker cover in more than one way. In this note we explore this phenomenon and apply it to show that the minimal common cover of two graphs need not be unique. We provide examples of graphs of the same size with non-unique common double covers and of isovalent graphs of the same size with nonunique minimal regular common covers.

Wilfried Imrich, Tomaz Pisanski

Real-time Traffic

Common Double Covers | EJC 2007 | EJC 2008 | Information Technology | Kronecker Cover | Minimal Common Cover |

claim paper

Related Content

» Realistic Mathematically Tractable Graph Generation and Evolution Using Kronecker Multipli...

» Scalable modeling of real graphs using Kronecker multiplication

» Quilting Stochastic Kronecker Product Graphs to Generate Multiplicative Attribute Graphs

» Kronecker Graphs An Approach to Modeling Networks

» Tight Bounds for the Cover Time of Multiple Random Walks

» Optimization problems in multiple subtree graphs

» Detecting Multiple Facets of an Event using GraphBased Unsupervised Methods

» Human Pose Estimation Using Consistent MaxCovering

» A CoverBased Approach to MultiAgent Moving Target Pursuit

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	EJC
Authors	Wilfried Imrich, Tomaz Pisanski

Comments (0)