Browse using
OpenLink Faceted Browser
OpenLink Structured Data Editor
LodLive Browser
Formats
RDF:
N-Triples
N3
Turtle
JSON
XML
OData:
Atom
JSON
Microdata:
JSON
HTML
Embedded:
JSON
Turtle
Other:
CSV
JSON-LD
Faceted Browser
Sparql Endpoint
About:
Complete graph
An Entity of Type:
Thing
,
from Named Graph:
http://dbpedia.org
,
within Data Space:
dbpedia.org
Simple undirected graph in which every pair of distinct vertices is connected by a unique edge
Property
Value
dbo:
description
olyan egyszerű irányítatlan gráf, amelynek minden két csúcsa között található él
(hu)
Begriff aus der Graphentheorie
(de)
graf, ve kterém je každá dvojice vrcholů spojena hranou
(cs)
grafo, je kiu ekzistas ununura eĝo inter ĉiu paro de malsamaj verticoj
(eo)
graf będący kliką
(pl)
tipo di grafo
(it)
type de graphe
(fr)
simple undirected graph in which every pair of distinct vertices is connected by a unique edge
(en)
концепция из теории графов
(ru)
任兩相異節點間洽有一條邊相連的無向圖
(zh)
απλός μη-κατευθυνόμενος γράφος όπου κάθε ζεύγος (διαφορετικών) κόμβων συνδέονται από μία ακμή
(el)
dbo:
thumbnail
wiki-commons
:Special:FilePath/Complete_graph_K7.svg?width=300
dbo:
wikiPageExternalLink
http://upload.wikimedia.org/wikipedia/commons/d/db/Csaszar_polyhedron_3D_model.svg
dbo:
wikiPageWikiLink
dbr
:E_(mathematical_constant)
dbr
:Crossing_number_(graph_theory)
dbr
:Perfect_matching
dbr
:Wagner's_theorem
dbr
:Mathematics
dbr
:Clique_(graph_theory)
dbr
:Integral_graph
dbr
:Leonhard_Euler
dbr
:Graph_theory
dbr
:Torus
dbr
:Triangle
dbr
:Seven_Bridges_of_Königsberg
dbr
:Kazimierz_Kuratowski
dbr
:Kuratowski's_theorem
dbr
:Triangular_number
dbr
:Hosoya_index
dbr
:Császár_polyhedron
dbr
:Complement_graph
dbr
:Complete_bipartite_graph
dbr
:Graph_minor
dbr
:Network_topology
dbr
:Bipartite_graph
dbr
:Vertex-transitive_graph
dbr
:Graph_drawing
dbr
:Path_(graph_theory)
dbr
:Planar_graph
dbr
:Tetrahedron
dbr
:Regular_graph
dbr
:Directed_graph
dbr
:Matching_(graph_theory)
dbr
:Knot_(mathematics)
dbr
:Tournament_(graph_theory)
dbr
:Orientation_(graph_theory)
dbr
:Ramon_Llull
dbr
:Linkless_embedding
dbr
:Edge_(graph_theory)
dbc
:Parametric_families_of_graphs
dbr
:Strongly_regular_graph
dbr
:Vertex_(graph_theory)
dbr
:Telephone_number_(mathematics)
dbr
:Regular_polygon
dbr
:Symmetric_group
dbr
:Petersen_family
dbr
:Edge-transitive_graph
dbr
:Double_factorial
dbr
:Connectivity_(graph_theory)
dbr
:Simplex
dbr
:Degree_(graph_theory)
dbr
:Symmetric_graph
dbr
:Undirected_graph
dbc
:Regular_graphs
dbr
:Neighborly_polytope
dbr
:Simple_graph
dbr
:Hamiltonian_cycle
dbr
:Vertex_cut
dbr
:Empty_graph
dbr
:Forbidden_minor
dbr
:File:9-simplex_graph.svg
dbr
:Skeleton_(topology)
dbr
:File:6-simplex_graph.svg
dbr
:File:10-simplex_graph.svg
dbr
:File:11-simplex_graph.svg
dbr
:File:3-simplex_graph.svg
dbr
:File:4-simplex_graph.svg
dbr
:File:5-simplex_graph.svg
dbr
:File:Complete_graph_K1.svg
dbr
:File:Complete_graph_K2.svg
dbr
:File:Complete_graph_K3.svg
dbr
:File:Complete_graph_K7.svg
dbr
:File:Csaszar_polyhedron_3D_model.svg
dbr
:File:8-simplex_graph.svg
dbr
:File:7-simplex_graph.svg
dbp:
imageCaption
, a complete graph with 7 vertices
(en)
dbp:
name
Complete graph
(en)
dbp:
title
Complete Graph
(en)
dbp:
urlname
CompleteGraph
(en)
dbp:
wikiPageUsesTemplate
dbt
:Infobox_graph
dbt
:Authority_control
dbt
:Commons
dbt
:Math
dbt
:MathWorld
dbt
:Mvar
dbt
:OEIS
dbt
:Reflist
dbt
:Short_description
dbt
:Sub
dbt
:Ubl
dbt
:Wiktionary
dct:
subject
dbc
:Parametric_families_of_graphs
dbc
:Regular_graphs
rdf:
type
owl
:Thing
owl
:Thing
rdfs:
label
Complete graph
(en)
Graf complet
(ca)
Úplný graf
(cs)
رسم بياني كامل
(ar)
Vollständiger Graph
(de)
Plena grafeo
(eo)
Grafo oso
(eu)
Grafo completo
(es)
Grafo completo
(it)
Graphe complet
(fr)
完全グラフ
(ja)
완전 그래프
(ko)
Grafo completo
(pt)
Graf pełny
(pl)
Полный граф
(ru)
Komplett graf
(sv)
Повний граф
(uk)
完全圖
(zh)
owl:
sameAs
dbpedia-commons
:Complete graph
freebase
:Complete graph
yago-res
:Complete graph
wikidata
:Complete graph
dbpedia-de
:Complete graph
dbpedia-es
:Complete graph
dbpedia-it
:Complete graph
dbpedia-pl
:Complete graph
dbpedia-fr
:Complete graph
dbpedia-da
:Complete graph
dbpedia-he
:Complete graph
dbpedia-hu
:Complete graph
dbpedia-ja
:Complete graph
dbpedia-pt
:Complete graph
dbpedia-ro
:Complete graph
dbpedia-ru
:Complete graph
dbpedia-zh
:Complete graph
dbpedia-sv
:Complete graph
dbpedia-vi
:Complete graph
dbpedia-ko
:Complete graph
dbpedia-ca
:Complete graph
dbpedia-et
:Complete graph
http://d-nb.info/gnd/4188588-0
dbpedia-ar
:Complete graph
dbpedia-cs
:Complete graph
dbpedia-eo
:Complete graph
dbpedia-eu
:Complete graph
dbpedia-fa
:Complete graph
dbpedia-hr
:Complete graph
dbpedia-is
:Complete graph
dbpedia-kk
:Complete graph
dbpedia-lt
:Complete graph
dbpedia-sk
:Complete graph
dbpedia-sl
:Complete graph
dbpedia-sr
:Complete graph
dbpedia-ta
:Complete graph
dbpedia-th
:Complete graph
dbpedia-uk
:Complete graph
dbpedia-ur
:Complete graph
dbpedia-global
:Complete graph
prov:
wasDerivedFrom
wikipedia-en
:Complete_graph?oldid=1303377516&ns=0
foaf:
depiction
wiki-commons
:Special:FilePath///upload.wikimedia.or.../d/db/Csaszar_polyhedron_3D_model.svg
wiki-commons
:Special:FilePath/10-simplex_graph.svg
wiki-commons
:Special:FilePath/11-simplex_graph.svg
wiki-commons
:Special:FilePath/3-simplex_graph.svg
wiki-commons
:Special:FilePath/4-simplex_graph.svg
wiki-commons
:Special:FilePath/5-simplex_graph.svg
wiki-commons
:Special:FilePath/6-simplex_graph.svg
wiki-commons
:Special:FilePath/7-simplex_graph.svg
wiki-commons
:Special:FilePath/8-simplex_graph.svg
wiki-commons
:Special:FilePath/9-simplex_graph.svg
wiki-commons
:Special:FilePath/Complete_graph_K1.svg
wiki-commons
:Special:FilePath/Complete_graph_K2.svg
wiki-commons
:Special:FilePath/Complete_graph_K3.svg
wiki-commons
:Special:FilePath/Complete_graph_K7.svg
wiki-commons
:Special:FilePath/Csaszar_polyhedron_3D_model.svg
foaf:
isPrimaryTopicOf
wikipedia-en
:Complete_graph
is
dbo:
wikiPageRedirects
of
dbr
:K_n
dbr
:Full_graph
dbr
:Complete_Digraph
dbr
:Complete_digraph
dbr
:Complete_graphs
dbr
:Tetrahedral_Graph
is
dbo:
wikiPageWikiLink
of
dbr
:Athanasius_Kircher
dbr
:Erdős–Ko–Rado_theorem
dbr
:Hexagon
dbr
:Pfaffian_orientation
dbr
:Enneagram_(geometry)
dbr
:Crossing_number_(graph_theory)
dbr
:Hypercube_graph
dbr
:Lovász_conjecture
dbr
:Clique-width
dbr
:Circulant_graph
dbr
:Circular_coloring
dbr
:K-tree
dbr
:Hanoi_graph
dbr
:Parity_graph
dbr
:Perfect_matching
dbr
:Graham–Rothschild_theorem
dbr
:Longest_path_problem
dbr
:Matrix_of_ones
dbr
:Wagner's_theorem
dbr
:Burr–Erdős_conjecture
dbr
:Category_algebra
dbr
:4
dbr
:5
dbr
:Square
dbr
:Clique_(graph_theory)
dbr
:Butterfly_graph
dbr
:Dodecagram
dbr
:Integral_graph
dbr
:Dining_cryptographers_problem
dbr
:Albertson_conjecture
dbr
:Partial_cube
dbr
:Partial_k-tree
dbr
:Pathwidth
dbr
:Rigidity_matroid
dbr
:Tree-depth
dbr
:Trémaux_tree
dbr
:Well-colored_graph
dbr
:K-minimum_spanning_tree
dbr
:Induced_gravity
dbr
:András_Hajnal
dbr
:NK_model
dbr
:Coxeter_graph
dbr
:Coxeter–Dynkin_diagram
dbr
:Tutte–Coxeter_graph
dbr
:Hermite_polynomials
dbr
:Expander_graph
dbr
:Friendship_paradox
dbr
:Forbidden_graph_characterization
dbr
:Windmill_graph
dbr
:IonQ
dbr
:Critical_point_(network_science)
dbr
:Distinguishing_coloring
dbr
:Frankl–Rödl_graph
dbr
:Hypersimplex
dbr
:Queue_number
dbr
:Split_(graph_theory)
dbr
:Christofides_algorithm
dbr
:Border_Gateway_Protocol
dbr
:Graph_theory
dbr
:Pál_Turán
dbr
:Torus
dbr
:Turán_graph
dbr
:K_(disambiguation)
dbr
:Tensor_product_of_graphs
dbr
:Three_utilities_problem
dbr
:Complex_system
dbr
:Kuratowski's_theorem
dbr
:Cycle_index
dbr
:Minimum_spanning_tree
dbr
:9-j_symbol
dbr
:Artin–Tits_group
dbr
:Mac_Lane's_planarity_criterion
dbr
:Frank_Harary
dbr
:Leader_election
dbr
:Critical_graph
dbr
:Claw-free_graph
dbr
:Clique_complex
dbr
:Cograph
dbr
:Comparability_graph
dbr
:Hosoya_index
dbr
:Edge-graceful_labeling
dbr
:Minimum_k-cut
dbr
:Random_minimum_spanning_tree
dbr
:Rectilinear_minimum_spanning_tree
dbr
:Regular_map_(graph_theory)
dbr
:Simplex_graph
dbr
:Skew_partition
dbr
:Slope_number
dbr
:Lattice_graph
dbr
:Ramsey_theory
dbr
:Steinitz's_theorem
dbr
:Halved_cube_graph
dbr
:Geodetic_graph
dbr
:Hedgehog_(hypergraph)
dbr
:Probabilistic_method
dbr
:Twin-width
dbr
:Andrew_M._Gleason
dbr
:Brooks'_theorem
dbr
:Clebsch_graph
dbr
:Graph_coloring
dbr
:Schläfli_graph
dbr
:Adjacency_matrix
dbr
:Császár_polyhedron
dbr
:Scale-free_network
dbr
:Hamiltonian_path
dbr
:Tree_(graph_theory)
dbr
:Baranyai's_theorem
dbr
:Complement_graph
dbr
:Complete_bipartite_graph
dbr
:Graph_minor
dbr
:Path_graph
dbr
:Ramsey's_theorem
dbr
:Kirchhoff's_theorem
dbr
:Book_embedding
dbr
:Boxicity
dbr
:Branch-decomposition
dbr
:Brauer_algebra
dbr
:Shield_of_the_Trinity
dbr
:Cycle_rank
dbr
:Lovász_number
dbr
:RAC_drawing
dbr
:Rainbow_coloring
dbr
:Thickness_(graph_theory)
dbr
:Induced_subgraph
dbr
:Kelmans–Seymour_conjecture
dbr
:PG(3,2)
dbr
:Cop-win_graph
dbr
:11_(number)
dbr
:15_(number)
dbr
:Polygon
dbr
:Network_topology
dbr
:Polyhedron
dbr
:String_(computer_science)
dbr
:Möbius_strip
dbr
:Ore's_theorem
dbr
:Association_scheme
dbr
:Bose–Mesner_algebra
dbr
:Graph_drawing
dbr
:Kneser_graph
dbr
:Matroid
dbr
:Treewidth
dbr
:Unit_distance_graph
dbr
:Hamming_graph
dbr
:Katalin_Vesztergombi
dbr
:Glossary_of_graph_theory
dbr
:Degeneracy_(graph_theory)
dbr
:Happy_ending_problem
dbr
:KN
dbr
:Matchstick_graph
dbr
:Steiner_tree_problem
dbr
:Crown_graph
dbr
:Diamond_graph
dbr
:Distance-regular_graph
dbr
:Gosset_graph
dbr
:K-vertex-connected_graph
dbr
:Moore_graph
dbr
:Outerplanar_graph
dbr
:Toroidal_graph
dbr
:Triangle_graph
dbr
:Wagner_graph
dbr
:Apex_graph
dbr
:Apollonian_network
dbr
:Exact_coloring
dbr
:Factor-critical_graph
dbr
:Hadwiger_number
dbr
:Hajós_construction
dbr
:Hammersley–Clifford_theorem
dbr
:Universal_graph
dbr
:Lollipop_graph
dbr
:Cereceda's_conjecture
dbr
:Crossing_Numbers_of_Graphs
dbr
:Pearls_in_Graph_Theory
dbr
:Brian_Alspach
dbr
:Geometric_graph_theory
dbr
:Planar_graph
dbr
:Aanderaa–Karp–Rosenberg_conjecture
dbr
:Grötzsch's_theorem
dbr
:Klaus_Wagner
dbr
:Laves_graph
dbr
:Tetrahedron
dbr
:Power_set
dbr
:Percolation_theory
dbr
:Petersen_graph
dbr
:Regular_graph
dbr
:Spanning_tree
dbr
:Theorem_on_friends_and_strangers
dbr
:Chinese_postman_problem
dbr
:Directed_graph
dbr
:Hadwiger_conjecture_(graph_theory)
dbr
:FKT_algorithm
dbr
:John_Ernest
dbr
:Neighbourhood_(graph_theory)
dbr
:Heawood_conjecture
dbr
:Perfect_graph_theorem
dbr
:Equitable_coloring
dbr
:Beta_skeleton
dbr
:Hemi-dodecahedron
dbr
:Hemi-icosahedron
dbr
:Hemicube_(geometry)
dbr
:Schwarz_triangle
dbr
:Graph_neural_network
dbr
:Johnson_graph
dbr
:Series–parallel_graph
dbr
:Mathematics_and_fiber_arts
dbr
:Folded_cube_graph
dbr
:Polyhedral_combinatorics
dbr
:Adjacent-vertex-distinguishing-total_coloring
dbr
:Bipartite_half
dbr
:Graph_amalgamation
dbr
:Cluster_graph
dbr
:Kirkman's_schoolgirl_problem
dbr
:Edge_coloring
dbr
:Matching_(graph_theory)
dbr
:Knot_(mathematics)
dbr
:Tournament_(graph_theory)
dbr
:Diseconomies_of_scale
dbr
:Subgraph_isomorphism_problem
dbr
:Bron–Kerbosch_algorithm
dbr
:Graph_homomorphism
dbr
:Haven_(graph_theory)
dbr
:Heawood_number
dbr
:Orientation_(graph_theory)
dbr
:132_(number)
dbr
:Homogeneous_graph
dbr
:Maximal_independent_set
dbr
:Uniquely_colorable_graph
dbr
:Well-covered_graph
dbr
:229_(number)
dbr
:Induced_path
dbr
:Line_perfect_graph
dbr
:1-center_problem
dbr
:Birkhoff_polytope
dbr
:Spectral_graph_theory
dbr
:Erdős–Rényi_model
dbr
:Nonagon
dbr
:1-planar_graph
dbr
:Euclidean_minimum_spanning_tree
dbr
:Quartic_graph
dbr
:Rado_graph
dbr
:Linkless_embedding
dbr
:No-three-in-line_problem
dbr
:Intersection_number_(graph_theory)
dbr
:Near_polygon
dbr
:Table_of_simple_cubic_graphs
dbr
:Well-separated_pair_decomposition
dbr
:Disjoint_union_of_graphs
dbr
:Hamiltonian_decomposition
dbr
:Oberwolfach_problem
dbr
:History_of_manifolds_and_varieties
dbr
:Anton_Kotzig
dbr
:Homeomorphism_(graph_theory)
dbr
:Strongly_regular_graph
dbr
:Erdős–Faber–Lovász_conjecture
dbr
:Erdős–Diophantine_graph
dbr
:Graph_factorization
dbr
:Graph_pebbling
dbr
:Graph_power
dbr
:Graphic_matroid
dbr
:Greedy_coloring
dbr
:Telephone_number_(mathematics)
dbr
:Freiling's_axiom_of_symmetry
dbr
:Core_(graph_theory)
dbr
:Cycle_graph
dbr
:Eulerian_path
dbr
:Mutually_orthogonal_Latin_squares
dbr
:Graham's_number
dbr
:Graham–Pollak_theorem
dbr
:Ronald_Graham
dbr
:Travelling_salesman_problem
dbr
:Cage_(graph_theory)
dbr
:Cayley's_formula
dbr
:List_of_unsolved_problems_in_mathematics
dbr
:Algebraic_combinatorics
dbr
:Hamiltonian_path_problem
dbr
:Dense_graph
dbr
:Petersen_family
dbr
:Heptagram
dbr
:K7
dbr
:K4
dbr
:Biconnected_graph
dbr
:Distance-transitive_graph
dbr
:Steiner_system
dbr
:Incompressibility_method
dbr
:Paving_matroid
dbr
:Positional_game
dbr
:Signed_graph
dbr
:Dimension_(graph_theory)
dbr
:Double_factorial
dbr
:Zero-divisor_graph
dbr
:Connectivity_(graph_theory)
dbr
:Pairwise_compatibility_graph
dbr
:Chang_graphs
dbr
:Geometric_spanner
dbr
:Graph_isomorphism
dbr
:Pseudoforest
dbr
:Simplex
dbr
:Vehicle_routing_problem
dbr
:Degree_(graph_theory)
dbr
:Michel_Deza
dbr
:Partition_of_a_set
is
foaf:
primaryTopic
of
wikipedia-en
:Complete_graph
This content was extracted from
Wikipedia
and is licensed under the
Creative Commons Attribution-ShareAlike 4.0 International