About: Undirected graph

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

About: Undirected graph Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, 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%2FUndirected_graph&invfp=IFP_OFF&sas=SAME_AS_OFF

Attributes	Values
rdfs:label	Neorientovaný graf (cs) Ungerichteter Graph (de) Graphe non orienté (fr) Undirected graph (en)
rdfs:comment	Neorientovaný graf se v teorii grafů označuje takový graf, jehož hrany jsou dvouprvkové množiny. Oproti tomu hrany orientovaného grafu jsou uspořádané dvojice. Hrany neorientovaného grafu nemají danou orientaci. Tudíž výrazy (x, y) a (y, x) označují stejnou hranu. Formálně je neorientovaný graf uspořádaná trojice . Prvky množiny jsou hranami grafu. Prvky množiny jsou uzly grafu. Zobrazení je incidencí grafu G. Incidence přiřazuje hranu ke dvojici uzlů. (cs) En théorie des graphes, un graphe non orienté est un couple formé de un ensemble de sommets et un ensemble d'arêtes, chaque arête étant une paire de sommets. Cette définition ne s'applique qu'aux graphes simples et n'est pas valable pour les multigraphes. (fr)
Wikipage page ID	1017538 (xsd:integer)
Wikipage revision ID	955709758 (xsd:integer)
Link from a Wikipage to another Wikipage	Graph (discrete mathematics)
Wikipage redirect	Graph (discrete mathematics)
sameAs	Undirected graph Undirected graph Undirected graph Undirected graph Undirected graph Undirected graph Undirected graph
dbp:wikiPageUsesTemplate	dbt:R_to_section dbt:Rcat_shell dbt:Wikidata-redirect
has abstract	Neorientovaný graf se v teorii grafů označuje takový graf, jehož hrany jsou dvouprvkové množiny. Oproti tomu hrany orientovaného grafu jsou uspořádané dvojice. Hrany neorientovaného grafu nemají danou orientaci. Tudíž výrazy (x, y) a (y, x) označují stejnou hranu. Formálně je neorientovaný graf uspořádaná trojice . Prvky množiny jsou hranami grafu. Prvky množiny jsou uzly grafu. Zobrazení je incidencí grafu G. Incidence přiřazuje hranu ke dvojici uzlů. (cs) En théorie des graphes, un graphe non orienté est un couple formé de un ensemble de sommets et un ensemble d'arêtes, chaque arête étant une paire de sommets. Cette définition ne s'applique qu'aux graphes simples et n'est pas valable pour les multigraphes. (fr)
prov:wasDerivedFrom	wikipedia-en:Undirected_graph?oldid=955709758&ns=0
page length (characters) of wiki page	116 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Undirected_graph
is Link from a Wikipage to another Wikipage of	Beckman–Quarles theorem Prim's algorithm Elementary Number Theory, Group Theory and Ramanujan Graphs List of dramatic television series with LGBT characters: 1960s–2000s Moser spindle Mycielskian Nowhere-zero flow Mac Lane's planarity criterion Meredith graph Meringer graph Prime graph Barnette's conjecture Biconnected component Binary logarithm Binary tree Bipartite double cover Degeneracy (graph theory) Dense subgraph Dessin d'enfant Antimatroid Apollonian network Arborescence (graph theory) Arboricity Homogeneous relation Beta skeleton Petersen family Relation (mathematics) Robert Frucht Cube-connected cycles Cuckoo hashing Cycle basis Cycle double cover Cycle rank Cycle space DSatur Unit distance graph V. J. Havel Vizing's theorem Voltage graph De Bruijn–Erdős theorem (graph theory) Deep belief network Degree matrix Double counting (proof technique) Dynkin diagram Dürer graph Ear decomposition Incidence and Symmetry in Design and Architecture Incidence matrix Incidence poset Independence complex Indifference graph Induced matching Induced path Induced subgraph Intersection number (graph theory) Jan Mycielski Level structure Pseudoforest Ptolemaic graph Robertson–Seymour theorem Robertson–Wegner graph Watts–Strogatz model Well-colored graph Zero-divisor graph Complete graph Connectivity (graph theory) Coxeter–Dynkin diagram Crossing number (graph theory) Crown graph Matrix of ones Matroid parity problem Median graph SL (complexity) Generalized geography Geodetic graph

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, 57 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software