| dbo:abstract
|
- Le produit tensoriel est une opération sur deux graphes et résultant en un graphe . Il est également appelé produit direct, produit de Kronecker ou produit catégorique. (fr)
- In graph theory, the tensor product G × H of graphs G and H is a graph such that
* the vertex set of G × H is the Cartesian product V(G) × V(H); and
* vertices (g,h) and (g',h' ) are adjacent in G × H if and only if
* g is adjacent to g' in G, and
* h is adjacent to h' in H. The tensor product is also called the direct product, Kronecker product, categorical product, cardinal product, relational product, weak direct product, or conjunction. As an operation on binary relations, the tensor product was introduced by Alfred North Whitehead and Bertrand Russell in their Principia Mathematica. It is also equivalent to the Kronecker product of the adjacency matrices of the graphs. The notation G × H is also (and formerly normally was) used to represent another construction known as the Cartesian product of graphs, but nowadays more commonly refers to the tensor product. The cross symbol shows visually the two edges resulting from the tensor product of two edges. This product should not be confused with the strong product of graphs. (en)
- Тензорное произведение графов и — граф, множество вершин которого есть декартово произведение , причём различные вершины и смежны в тогда и только тогда, когда смежна с и смежна с . (ru)
- Тензорний добуток графів і — граф, множина вершин якого є декартовим добутком , причому різні вершини і суміжні в тоді, коли суміжна з і суміжна з . (uk)
|
| dbo:thumbnail
| |
| dbo:wikiPageExternalLink
| |
| dbo:wikiPageID
| |
| dbo:wikiPageLength
|
- 7684 (xsd:nonNegativeInteger)
|
| dbo:wikiPageRevisionID
| |
| dbo:wikiPageWikiLink
| |
| dbp:author
| |
| dbp:title
|
- Graph Categorical Product (en)
|
| dbp:urlname
|
- GraphCategoricalProduct (en)
|
| dbp:wikiPageUsesTemplate
| |
| dcterms:subject
| |
| gold:hypernym
| |
| rdf:type
| |
| rdfs:comment
|
- Le produit tensoriel est une opération sur deux graphes et résultant en un graphe . Il est également appelé produit direct, produit de Kronecker ou produit catégorique. (fr)
- Тензорное произведение графов и — граф, множество вершин которого есть декартово произведение , причём различные вершины и смежны в тогда и только тогда, когда смежна с и смежна с . (ru)
- Тензорний добуток графів і — граф, множина вершин якого є декартовим добутком , причому різні вершини і суміжні в тоді, коли суміжна з і суміжна з . (uk)
- In graph theory, the tensor product G × H of graphs G and H is a graph such that
* the vertex set of G × H is the Cartesian product V(G) × V(H); and
* vertices (g,h) and (g',h' ) are adjacent in G × H if and only if
* g is adjacent to g' in G, and
* h is adjacent to h' in H. (en)
|
| rdfs:label
|
- Produit tensoriel (graphe) (fr)
- Tensor product of graphs (en)
- Тензорное произведение графов (ru)
- Тензорний добуток графів (uk)
|
| owl:differentFrom
| |
| owl:sameAs
| |
| prov:wasDerivedFrom
| |
| foaf:depiction
| |
| foaf:isPrimaryTopicOf
| |
| is dbo:notableIdea
of | |
| is dbo:wikiPageDisambiguates
of | |
| is dbo:wikiPageRedirects
of | |
| is dbo:wikiPageWikiLink
of | |
| is dbp:notableIdeas
of | |
| is foaf:primaryTopic
of | |
