@prefix psr: <http://data.loterre.fr/ark:/67375/PSR> .
@prefix skos: <http://www.w3.org/2004/02/skos/core#> .
@prefix dc: <http://purl.org/dc/terms/> .
@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .

psr: a skos:ConceptScheme .
psr:-NNM3SBTX-L
  skos:prefLabel "regular graph"@en, "graphe régulier"@fr ;
  skos:inScheme psr: ;
  dc:modified "2024-10-18"^^xsd:date ;
  skos:broader psr:-T1J15DPM-T ;
  skos:definition """In graph theory, a regular graph is a graph where each vertex has the same number of neighbors; i.e. every vertex has the same degree or valency. A regular directed graph must also satisfy the stronger condition that the indegree and outdegree of each internal vertex are equal to each other. A regular graph with vertices of degree k is called a k‑regular graph or regular graph of degree k. Also, from the handshaking lemma, a regular graph contains an even number of vertices with odd degree. 
<br/>(Wikipedia, The Free Encyclopedia, <a href="https://en.wikipedia.org/wiki/Regular_graph">https://en.wikipedia.org/wiki/Regular_graph</a>)"""@en, """En théorie des graphes, un graphe régulier est un graphe où tous les sommets ont le même nombre de voisins, c'est-à-dire le même degré ou valence. Un graphe régulier dont les sommets sont de degré k est appelé un graphe k-régulier ou graphe régulier de degré k. 
<br/>(Wikipedia, L'Encylopédie Libre, <a href="https://fr.wikipedia.org/wiki/Graphe_r%C3%A9gulier">https://fr.wikipedia.org/wiki/Graphe_r%C3%A9gulier</a>)"""@fr ;
  skos:exactMatch <https://fr.wikipedia.org/wiki/Graphe_r%C3%A9gulier>, <https://en.wikipedia.org/wiki/Regular_graph> ;
  a skos:Concept .

psr:-T1J15DPM-T
  skos:prefLabel "graphe"@fr, "graph"@en ;
  a skos:Concept ;
  skos:narrower psr:-NNM3SBTX-L .