In graph theory, a mathematical discipline which has applications in computer science, as well as in many other disciplines, a bivariegated graph is a graph whose vertex set can be partitioned into two equal parts such that each vertex is adjacent to exactly one vertex from the other set not containing it. In a bivarigated graph G with 2n vertices, there exists a set of n independent edges such that no odd number of them lie on a cycle of G.
| Property | Value |
|---|
| dbpedia-owl:thumbnail
| |
| dbpprop:abstract
|
- In graph theory, a mathematical discipline which has applications in computer science, as well as in many other disciplines, a bivariegated graph is a graph whose vertex set can be partitioned into two equal parts such that each vertex is adjacent to exactly one vertex from the other set not containing it. In a bivarigated graph G with 2n vertices, there exists a set of n independent edges such that no odd number of them lie on a cycle of G.
|
| dbpprop:relatedInstance
| |
| rdfs:comment
|
- In graph theory, a mathematical discipline which has applications in computer science, as well as in many other disciplines, a bivariegated graph is a graph whose vertex set can be partitioned into two equal parts such that each vertex is adjacent to exactly one vertex from the other set not containing it. In a bivarigated graph G with 2n vertices, there exists a set of n independent edges such that no odd number of them lie on a cycle of G.
|
| rdfs:label
| |
| owl:sameAs
| |
| skos:subject
| |
| foaf:depiction
| |
| foaf:page
| |
| is dbpedia-owl:Person/knownFor
of | |
| is dbpedia-owl:knownFor
of | |
| is dbpprop:knownFor
of | |
| is dbpprop:redirect
of | |
![[RDF Data]](/statics/sw-cube.png)
