About: Graph operations

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Graph operations Goto Sponge NotDistinct Permalink

An Entity of Type : yago:State100024720, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon

http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FGraph_operations&invfp=IFP_OFF&sas=SAME_AS_OFF

In the mathematical field of graph theory, graph operations are operations which produce new graphs from initial ones. They include both unary (one input) and binary (two input) operations.

Attributes	Values
rdf:type	yago:Abstraction100002137 yago:Action114006945 yago:Attribute100024264 yago:Operation114008806 yago:WikicatGraphOperations yago:State100024720
rdfs:label	Graph operations (en) Graphenoperation (de) União de grafos (pt) Операции над графами (ru) Операції над графами (uk) 圖運算 (zh)
rdfs:comment	In the mathematical field of graph theory, graph operations are operations which produce new graphs from initial ones. They include both unary (one input) and binary (two input) operations. (en) A união de dois grafos é definida como: Para dois grafos com conjuntos disjuntos de vértices (não são iguais) V1 e V2 (e daí conjuntos disjuntos de arestas), sua união disjunta é o grafo U(V1 ∪ V2, E1 ∪ E2)). É uma operação comutativa e associativa (para grafos não-etiquetados). (pt) Операции над графами образуют новые графы из старых. Операции можно разделить на следующие основные категории. (ru) 在圖論中，可以藉由圖運算產生一些新的圖。 (zh) Операції над графами утворюють нові графи зі старих. Операції можна розділити на такі основні категорії. (uk)
dcterms:subject	Graph operations
Wikipage page ID	9938244 (xsd:integer)
Wikipage revision ID	1098121201 (xsd:integer)
Link from a Wikipage to another Wikipage	Cartesian product Mycielskian Unary operation Lexicographic product of graphs Strong product of graphs Quotient graph Graph (discrete mathematics) Graph minor Line graph Complement graph Transpose graph Disjoint union of graphs Dual graph Graph edit distance Graph rewriting Graph theory Hajós construction Tensor product of graphs Binary operation Graph operations Edge contraction Graph products Operation (mathematics) Cartesian product of graphs Medial graph Union (set theory) Rooted product of graphs Series–parallel graph Y-Δ transform Mathematical Zig-zag product of graphs Power of graph dbr:Corona_product_of_graphs
sameAs	Graph operations Graph operations Graph operations Graph operations Graph operations Graph operations Graph operations Graph operations Graph operations Graph operations Graph operations
dbp:wikiPageUsesTemplate	dbt:Anchor dbt:Nobreak dbt:Short_description
has abstract	In the mathematical field of graph theory, graph operations are operations which produce new graphs from initial ones. They include both unary (one input) and binary (two input) operations. (en) A união de dois grafos é definida como: Para dois grafos com conjuntos disjuntos de vértices (não são iguais) V1 e V2 (e daí conjuntos disjuntos de arestas), sua união disjunta é o grafo U(V1 ∪ V2, E1 ∪ E2)). É uma operação comutativa e associativa (para grafos não-etiquetados). (pt) Операции над графами образуют новые графы из старых. Операции можно разделить на следующие основные категории. (ru) 在圖論中，可以藉由圖運算產生一些新的圖。 (zh) Операції над графами утворюють нові графи зі старих. Операції можна розділити на такі основні категорії. (uk)
prov:wasDerivedFrom	wikipedia-en:Graph_operations?oldid=1098121201&ns=0
page length (characters) of wiki page	4872 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Graph_operations
is Link from a Wikipage to another Wikipage of	Incidence coloring Elementary graph operation Operation Glossary of graph theory GraphBLAS Graph edit operation Graph product Zig-zag product Corona Graph operation 73 (number) Graph edit distance Graph entropy Hajós construction Edge contraction Graph Union Graph union Metric space László Rátz Planar cover Unary graph operation Operations on graphs Sum of two graphs Vertex deletion Vertex merging

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 67 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software