This HTML5 document contains 45 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n13https://global.dbpedia.org/id/
yagohttp://dbpedia.org/class/yago/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
provhttp://www.w3.org/ns/prov#
dbchttp://dbpedia.org/resource/Category:
dbphttp://dbpedia.org/property/
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Regular_graph
dbo:wikiPageWikiLink
dbr:Highly_irregular_graph
Subject Item
dbr:Gary_Chartrand
dbo:wikiPageWikiLink
dbr:Highly_irregular_graph
Subject Item
dbr:Highly_irregular_graph
rdf:type
yago:Unit108189659 yago:Family108078020 yago:YagoLegalActor yago:YagoLegalActorGeo yago:YagoPermanentlyLocatedEntity yago:WikicatGraphFamilies dbo:Software yago:Organization108008335 yago:SocialGroup107950920 yago:Abstraction100002137 yago:Group100031264
rdfs:label
Highly irregular graph
rdfs:comment
In graph theory, a highly irregular graph is a graph in which, for every vertex, all neighbors of that vertex have distinct degrees.
dcterms:subject
dbc:Graph_families
dbo:wikiPageID
42651881
dbo:wikiPageRevisionID
940369546
dbo:wikiPageWikiLink
dbr:Ronald_Graham dbr:Fan_Chung dbr:Dénes_Kőnig dbr:Regular_graph dbr:Degree_(graph_theory) dbc:Graph_families dbr:Gary_Chartrand dbr:Graph_(discrete_mathematics) dbr:Yousef_Alavi dbr:Induced_subgraph dbr:Ortrud_Oellermann dbr:Paul_Erdős dbr:Graph_theory
owl:sameAs
freebase:m.010gp4hp wikidata:Q17029695 n13:fAbN yago-res:Highly_irregular_graph
dbp:wikiPageUsesTemplate
dbt:Reflist
dbo:abstract
In graph theory, a highly irregular graph is a graph in which, for every vertex, all neighbors of that vertex have distinct degrees.
gold:hypernym
dbr:Graph
prov:wasDerivedFrom
wikipedia-en:Highly_irregular_graph?oldid=940369546&ns=0
dbo:wikiPageLength
4114
foaf:isPrimaryTopicOf
wikipedia-en:Highly_irregular_graph
Subject Item
dbr:Ortrud_Oellermann
dbo:wikiPageWikiLink
dbr:Highly_irregular_graph
Subject Item
dbr:Highly_Irregular_Graph
dbo:wikiPageWikiLink
dbr:Highly_irregular_graph
dbo:wikiPageRedirects
dbr:Highly_irregular_graph
Subject Item
wikipedia-en:Highly_irregular_graph
foaf:primaryTopic
dbr:Highly_irregular_graph