|
|
| (One intermediate revision by the same user not shown) |
| Line 1: |
Line 1: |
| In [[graph theory]], the '''bipartite double cover''' of an [[undirected graph]] ''G'' is a [[bipartite graph|bipartite]] [[covering graph]] of ''G'', with twice as many vertices as ''G''. It can be constructed as the [[tensor product of graphs]] ''G'' × ''K''<sub>2</sub>. It is also called the '''Kronecker double cover''', '''canonical double cover''' or simply the '''bipartite double''' of ''G''.
| | Next - GEN Gallery is a full incorporated Image Gallery plugin for Word - Press which has a Flash slideshow option. Good luck on continue learning how to make a wordpress website. PSD files are incompatible to browsers and are suppose to be converted into wordpress compatible files so that it opens up in browser. Dead links are listed out simply because it will negatively have an influence on the website's search engine rating. By using this method one can see whether the theme has the potential to become popular or not and is their any scope of improvement in the theme. <br><br>Creating a website from scratch can be such a pain. When you write a new post, you'll see a small bar that goes across the text input area. A Wordpress plugin is a software that you can install into your Wordpress site. You can up your site's rank with the search engines by simply taking a bit of time with your site. For a Wordpress website, you don't need a powerful web hosting account to host your site. <br><br>Photography is an entire activity in itself, and a thorough discovery of it is beyond the opportunity of this content. Word - Press has ensured the users of this open source blogging platform do not have to troubleshoot on their own, or seek outside help. You can now search through the thousands of available plugins to add all kinds of functionality to your Word - Press site. User friendly features and flexibility that Word - Press has to offer is second to none. Socrates: (link to ) Originally developed for affiliate marketers, I've used this theme again and again to develop full-fledged web sites that include static pages, squeeze pages, and a blog. <br><br>The disadvantage is it requires a considerable amount of time to set every thing up. Quttera - Quttera describes itself as a 'Saa - S [Software as a Service] web-malware monitoring and alerting solution for websites of any size and complexity. When we talk about functional suitability, Word - Press proves itself as one of the strongest contestant among its other rivals. The most important plugins you will need are All-in-One SEO Pack, some social bookmarking plugin, a Feedburner plugin and an RSS sign up button. If you treasured this article and you would like to collect more info concerning [http://deurl.de/wordpress_backup_829490 wordpress backup plugin] i implore you to visit our own internet site. Where from they are coming, which types of posts are getting top traffic and many more. <br><br>He loves sharing information regarding wordpress, Majento, Drupal and Joomla development tips & tricks. As a website owner, you can easily manage CMS-based website in a pretty easy and convenient style. Offshore Wordpress development services from a legitimate source caters dedicated and professional services assistance with very simplified yet technically effective development and designing techniques from experienced professional Wordpress developer India. Extra investment in Drupal must be bypassed as value for money is what Drupal provides. Customers within a few seconds after visiting a site form their opinion about the site. |
| | |
| It should not be confused with a [[cycle double cover conjecture|cycle double cover]] of a graph, a family of cycles that includes each edge twice.
| |
| | |
| ==Construction==
| |
| The bipartite double cover of ''G'' has two vertices ''u<sub>i</sub>'' and ''w<sub>i</sub>'' for each vertex ''v<sub>i</sub>'' of ''G''. Two vertices ''u<sub>i</sub>'' and ''w<sub>j</sub>'' are connected by an edge in the double cover if and only if ''v<sub>i</sub>'' and ''v<sub>j</sub>'' are connected by an edge in ''G''. For instance, below is an illustration of a bipartite double cover of a non-bipartite graph ''G''. In the illustration, each vertex in the tensor product is shown using a color from the first term of the product (''G'') and a shape from the second term of the product (''K''<sub>2</sub>); therefore, the vertices ''u<sub>i</sub>'' in the double cover are shown as circles while the vertices ''w<sub>i</sub>'' are shown as squares.
| |
| | |
| :[[Image:Covering-graph-2.svg]]
| |
| | |
| The bipartite double cover may also be constructed using adjacency matrices (as described below) or as the derived graph of a [[voltage graph]] in which each edge of ''G'' is labeled by the nonzero element of the two-element [[group (mathematics)|group]].
| |
| | |
| ==Examples==
| |
| The bipartite double cover of the [[Petersen graph]] is the [[Desargues graph]]: ''K''<sub>2</sub> × ''G''(5,2) = ''G''(10,3).
| |
| | |
| The bipartite double cover of a [[complete graph]] ''K<sub>n</sub>'' is a [[crown graph]] (a [[complete bipartite graph]] ''K<sub>n</sub>''<sub>,''n''</sub> minus a [[perfect matching]]). In particular, the bipartite double cover of the graph of a [[tetrahedron]], ''K''<sub>4</sub>, is the graph of a [[cube]].
| |
| | |
| The bipartite double cover of an odd-length [[cycle graph]] is a cycle of twice the length, while the bipartite double of any bipartite graph (such as an even length cycle, shown in the following example) is formed by two disjoint copies of the original graph.
| |
| | |
| :[[Image:Covering-graph-1.svg]]
| |
| | |
| ==Matrix interpretation==
| |
| If an undirected graph ''G'' has a matrix ''A'' as its [[adjacency matrix]], then the adjacency matrix of the double cover of ''G'' is
| |
| :<math>\left[\begin{matrix}0&A\\A^T&0\end{matrix}\right],</math>
| |
| and the [[biadjacency matrix]] of the double cover of ''G'' is just ''A'' itself. That is, the conversion from a graph to its double cover can be performed simply by reinterpreting ''A'' as a biadjacency matrix instead of as an adjacency matrix. More generally, the reinterpretation the adjacency matrices of [[directed graph]]s as biadjacency matrices provides a [[bijective proof|combinatorial equivalence]] between directed graphs and balanced bipartite graphs.<ref>{{harvtxt|Dulmage|Mendelsohn|1958}}; {{harvtxt|Brualdi|Harary|Miller|1980}}.</ref>
| |
| | |
| ==Properties==
| |
| The bipartite double cover of any graph ''G'' is a [[bipartite graph]]; both parts of the bipartite graph have one vertex for each vertex of ''G''. A bipartite double cover is [[connected graph|connected]] if and only if ''G'' is connected and non-bipartite.<ref>{{harvtxt|Brualdi|Harary|Miller|1980}}, Theorem 3.4.</ref>
| |
| | |
| The bipartite double cover is a special case of a ''double cover'' (a 2-fold [[covering graph]]). A double cover in graph theory can be viewed as a special case of a [[Double cover (topology)|topological double cover]].
| |
| | |
| If ''G'' is a non-bipartite [[symmetric graph]], the double cover of ''G'' is also a symmetric graph; several known [[cubic graph|cubic]] symmetric graphs may be obtained in this way. For instance, the double cover of ''K''<sub>4</sub> is the graph of a cube; the double cover of the Petersen graph is the Desargues graph; and the double cover of the graph of the [[dodecahedron]] is a 40-vertex symmetric cubic graph.<ref>{{harvtxt|Feng|Kutnar|Malnič|Marušic|2008}}.</ref>
| |
| | |
| It is possible for two different graphs to have [[graph isomorphism|isomorphic]] bipartite double covers. For instance, the Desargues graph is not only the bipartite double cover of the Petersen graph, but is also the bipartite double cover of a different graph that is not isomorphic to the Petersen graph.<ref name="ip08">{{harvtxt|Imrich|Pisanski|2008}}.</ref> Not every bipartite graph is a bipartite double cover of another graph; for a bipartite graph ''G'' to be the bipartite cover of another graph, it is necessary and sufficient that the [[graph automorphism|automorphism]]s of ''G'' include an [[Involution (mathematics)|involution]] that maps each vertex to a distinct and non-adjacent vertex.<ref name="ip08"/> For instance, the graph with two vertices and one edges is bipartite but is not a bipartite double cover, because it has no non-adjacent pairs of vertices to be mapped to each other by such an involution; on the other hand, the graph of the cube is a bipartite double cover, and has an involution that maps each vertex to the diametrally opposite vertex. An alternative characterization of the bipartite graphs that may be formed by the bipartite double cover construction was obtained by {{harvtxt|Sampathkumar|1975}}.
| |
| | |
| ==Other double covers==
| |
| In general, a graph may have multiple double covers that are different from the bipartite double cover.<ref>{{harvtxt|Waller|1976}}.</ref> In the following figure, the graph ''C'' is a double cover of the graph ''H'':
| |
| # The graph ''C'' is a ''covering graph'' of ''H'': there is a surjective local isomorphism ''f'' from ''C'' to ''H'', the one indicated by the colours. For example, ''f'' maps both blue nodes in ''C'' to the blue node in ''H''. Furthermore, let ''X'' be the [[Neighbourhood (graph theory)|neighbourhood]] of a blue node in ''C'' and let ''Y'' be the neighbourhood of the blue node in ''H''; then the restriction of ''f'' to ''X'' is a bijection from ''X'' to ''Y''. In particular, the degree of each blue node is the same. The same applies to each colour.
| |
| # The graph ''C'' is a ''double'' cover (or ''2-fold cover'' or ''2-lift'') of ''H'': the preimage of each node in ''H'' has size 2. For example, there are exactly 2 nodes in ''C'' that are mapped to the blue node in ''H''.
| |
| However, ''C'' is not a ''bipartite'' double cover of ''H'' or any other graph; it is not a bipartite graph.
| |
| | |
| If we replace one triangle by a square in ''H ''the resulting graph has four distinct double covers. Two of them are bipartite but only one of them is the Kronecker cover. | |
| | |
| :[[Image:Covering-graph-4.svg]]
| |
| | |
| As another example, the graph of the [[icosahedron]] is a double cover of the complete graph ''K''<sub>6</sub>; to obtain a covering map from the icosahedron to ''K''<sub>6</sub>, map each pair of opposite vertices of the icosahedron to a single vertex of ''K''<sub>6</sub>. However, the icosahedron is not bipartite, so it is not the bipartite double cover of ''K''<sub>6</sub>. Instead, it can be obtained as the [[orientable double cover]] of an [[graph embedding|embedding]] of ''K''<sub>6</sub> on the [[projective plane]].
| |
| | |
| ==See also==
| |
| *[[Bipartite half]]
| |
| | |
| ==Notes==
| |
| {{reflist|2}}
| |
| | |
| ==References==
| |
| *{{citation
| |
| | last1 = Brualdi | first1 = Richard A.
| |
| | last2 = Harary | first2 = Frank | author2-link = Frank Harary
| |
| | last3 = Miller | first3 = Zevi
| |
| | doi = 10.1002/jgt.3190040107
| |
| | mr = 558453
| |
| | issue = 1
| |
| | journal = Journal of Graph Theory
| |
| | pages = 51–73
| |
| | title = Bigraphs versus digraphs via matrices
| |
| | volume = 4
| |
| | year = 1980}}.
| |
| *{{citation
| |
| | doi = 10.4153/CJM-1958-052-0
| |
| | last1 = Dulmage | first1 = A. L.
| |
| | last2 = Mendelsohn | first2 = N. S. | author2-link = Nathan Mendelsohn
| |
| | mr = 0097069
| |
| | journal = Canadian Journal of Mathematics
| |
| | pages = 517–534
| |
| | title = Coverings of bipartite graphs
| |
| | volume = 10
| |
| | year = 1958}}. The “coverings” in the title of this paper refer to the [[vertex cover]] problem, not to bipartite double covers. However, {{harvtxt|Brualdi|Harary|Miller|1980}} cite this paper as the source of the idea of reinterpreting the adjacency matrix as a biadjacency matrix.
| |
| *{{citation
| |
| | last1 = Feng | first1 = Yan-Quan
| |
| | last2 = Kutnar | first2 = Klavdija
| |
| | last3 = Malnič | first3 = Aleksander
| |
| | last4 = Marušic | first4 = Dragan
| |
| | doi = 10.1016/j.jctb.2007.07.001
| |
| | arxiv = math.CO/0701722 |mr=2389602 | issue = 2
| |
| | journal = Journal of Combinatorial Theory, Series B
| |
| | pages = 324–341
| |
| | title = On 2-fold covers of graphs
| |
| | volume = 98
| |
| | year = 2008}}.
| |
| *{{citation
| |
| | first1 = Wilfried | last1 = Imrich
| |
| | last2 = Pisanski | first2 = Tomaž | author2-link = Tomaž Pisanski
| |
| | mr = 2419215
| |
| | title = Multiple Kronecker covering graphs
| |
| | journal = European Journal of Combinatorics
| |
| | volume = 29 | issue = 5 | year = 2008 | pages = 1116–1122
| |
| | doi = 10.1016/j.ejc.2007.07.001}}.
| |
| *{{citation
| |
| | doi = 10.1017/S1446788700020619
| |
| | last = Sampathkumar | first = E. | author1-link = E. Sampathkumar
| |
| | mr = 0389681
| |
| | issue = 3
| |
| | journal = Journal of the Australian Mathematical Society, Series A, Pure Mathematics and Statistics
| |
| | pages = 268–273
| |
| | title = On tensor product graphs
| |
| | volume = 20
| |
| | year = 1975}}.
| |
| *{{citation
| |
| | doi = 10.1017/S0004972700025053
| |
| | last = Waller | first = Derek A.
| |
| | mr = 0406876
| |
| | issue = 2
| |
| | journal = Bulletin of the Australian Mathematical Society
| |
| | pages = 233–248
| |
| | title = Double covers of graphs
| |
| | volume = 14
| |
| | year = 1976}}.
| |
| | |
| ==External links==
| |
| *{{mathworld | title = Bipartite Double Graph | urlname = BipartiteDoubleGraph}}
| |
| | |
| [[Category:Graph operations]]
| |
Next - GEN Gallery is a full incorporated Image Gallery plugin for Word - Press which has a Flash slideshow option. Good luck on continue learning how to make a wordpress website. PSD files are incompatible to browsers and are suppose to be converted into wordpress compatible files so that it opens up in browser. Dead links are listed out simply because it will negatively have an influence on the website's search engine rating. By using this method one can see whether the theme has the potential to become popular or not and is their any scope of improvement in the theme.
Creating a website from scratch can be such a pain. When you write a new post, you'll see a small bar that goes across the text input area. A Wordpress plugin is a software that you can install into your Wordpress site. You can up your site's rank with the search engines by simply taking a bit of time with your site. For a Wordpress website, you don't need a powerful web hosting account to host your site.
Photography is an entire activity in itself, and a thorough discovery of it is beyond the opportunity of this content. Word - Press has ensured the users of this open source blogging platform do not have to troubleshoot on their own, or seek outside help. You can now search through the thousands of available plugins to add all kinds of functionality to your Word - Press site. User friendly features and flexibility that Word - Press has to offer is second to none. Socrates: (link to ) Originally developed for affiliate marketers, I've used this theme again and again to develop full-fledged web sites that include static pages, squeeze pages, and a blog.
The disadvantage is it requires a considerable amount of time to set every thing up. Quttera - Quttera describes itself as a 'Saa - S [Software as a Service] web-malware monitoring and alerting solution for websites of any size and complexity. When we talk about functional suitability, Word - Press proves itself as one of the strongest contestant among its other rivals. The most important plugins you will need are All-in-One SEO Pack, some social bookmarking plugin, a Feedburner plugin and an RSS sign up button. If you treasured this article and you would like to collect more info concerning wordpress backup plugin i implore you to visit our own internet site. Where from they are coming, which types of posts are getting top traffic and many more.
He loves sharing information regarding wordpress, Majento, Drupal and Joomla development tips & tricks. As a website owner, you can easily manage CMS-based website in a pretty easy and convenient style. Offshore Wordpress development services from a legitimate source caters dedicated and professional services assistance with very simplified yet technically effective development and designing techniques from experienced professional Wordpress developer India. Extra investment in Drupal must be bypassed as value for money is what Drupal provides. Customers within a few seconds after visiting a site form their opinion about the site.