cometadata/datacite-titles-descriptions-related-identifiers huggingface dataset:
DOI: 10.17632/d75dzbjd4k.2
title: Table of Large Degree/Diameter Graphs

description: A graph, G=(V,E), consists of a non empty finite set V of elements called vertices and a set E of pairs of elements of V called edges. The number of vertices N=|G|=|V| is the order of the graph. If (x,y) is an edge of E, we say that x and y (or y and x) are adjacent and this is usually written x --&gt; y. It is also said that x and y are the endvertices of the edge (x,y). The degree of a vertex δ(x) is the number of vertices adjacent to x. The degree of G is Δ=max_{x ∈ V} δ(x). A graph is regular of degree Δ or Δ - regular if the degree of all vertices equal Δ. The distance between two vertices x and y, d(x,y) , is the number of edges of a shortest path between x and y , and its maximum value over all pair of vertices, D=max_{x, y ∈ V}d(x,y) , is the diameter of the graph. A (Δ,D) graph is a graph with maximum degree Δ and diameter at most D. The order of a graph with degree Δ, Δ &gt; 2), of diameter D is easily seen to be bounded by

1 + Δ + Δ (Δ-1) + ...+ Δ (Δ-1) D-1 = (Δ (Δ-1)D -2) / (Δ-2) = N(Δ, D)

Hoffman and Singleton introduced the concept of Moore graphs, after Edward Forrest Moore, as graphs attaining this value, known as Moore bound. They also showed that, for D ≥ 2 and Δ ≥ 3, Moore graphs exist for D=2 and Δ =3,7 , and (perhaps) 57. In this context, it is of great interest to find graphs which for a given maximum diameter and maximum degree have a number of vertices as close as possible to the Moore bound.

Download the package, unpack it and open in a browser the file 
 table_degree_diameter.html or the file taula_delta_d.html.

The table in this page gives the state of the art with respect to the LARGEST KNOWN (Δ ,D)-GRAPHS as in May 2024.
Click the position if you wish to know more information: graph construction details, Moore bound, author, references... For most small (&lt; 20000) order values you can download the adjacency list. 
Entries in boldface are optimal.
DOI: 10.17632/d75dzbjd4k.3
title: Table of Large Degree/Diameter Graphs

description: A graph, G=(V,E), consists of a non empty finite set V of elements called vertices and a set E of pairs of elements of V called edges. The number of vertices N=|G|=|V| is the order of the graph. If (x,y) is an edge of E, we say that x and y (or y and x) are adjacent and this is usually written x --&gt; y. It is also said that x and y are the endvertices of the edge (x,y). The degree of a vertex δ(x) is the number of vertices adjacent to x. The degree of G is Δ=max_{x ∈ V} δ(x). A graph is regular of degree Δ or Δ - regular if the degree of all vertices equal Δ. The distance between two vertices x and y, d(x,y) , is the number of edges of a shortest path between x and y , and its maximum value over all pair of vertices, D=max_{x, y ∈ V}d(x,y) , is the diameter of the graph. A (Δ,D) graph is a graph with maximum degree Δ and diameter at most D. The order of a graph with degree Δ, Δ &gt; 2), of diameter D is easily seen to be bounded by

1 + Δ + Δ (Δ-1) + ...+ Δ (Δ-1) D-1 = (Δ (Δ-1)D -2) / (Δ-2) = N(Δ, D)

Hoffman and Singleton introduced the concept of Moore graphs, after Edward Forrest Moore, as graphs attaining this value, known as Moore bound. They also showed that, for D ≥ 2 and Δ ≥ 3, Moore graphs exist for D=2 and Δ =3,7 , and (perhaps) 57. In this context, it is of great interest to find graphs which for a given maximum diameter and maximum degree have a number of vertices as close as possible to the Moore bound.

Download the package, unpack it and open in a browser the file 
 table_degree_diameter.html or the file taula_delta_d.html.

The table in this page gives the state of the art with respect to the LARGEST KNOWN (Δ ,D)-GRAPHS as in May 2024.
Click the position if you wish to know more information: graph construction details, Moore bound, author, references... For most small (&lt; 20000) order values you can download the adjacency list. 
Entries in boldface are optimal.
DOI: 10.17632/d75dzbjd4k.4
title: Table of Large Degree/Diameter Graphs

description: A graph, G=(V,E), consists of a non empty finite set V of elements called vertices and a set E of pairs of elements of V called edges. The number of vertices N=|G|=|V| is the order of the graph. If (x,y) is an edge of E, we say that x and y (or y and x) are adjacent and this is usually written x --&gt; y. It is also said that x and y are the endvertices of the edge (x,y). The degree of a vertex δ(x) is the number of vertices adjacent to x. The degree of G is Δ=max_{x ∈ V} δ(x). A graph is regular of degree Δ or Δ - regular if the degree of all vertices equal Δ. The distance between two vertices x and y, d(x,y) , is the number of edges of a shortest path between x and y , and its maximum value over all pair of vertices, D=max_{x, y ∈ V}d(x,y) , is the diameter of the graph. A (Δ,D) graph is a graph with maximum degree Δ and diameter at most D. The order of a graph with degree Δ, Δ &gt; 2), of diameter D is easily seen to be bounded by

1 + Δ + Δ (Δ-1) + ...+ Δ (Δ-1) D-1 = (Δ (Δ-1)D -2) / (Δ-2) = N(Δ, D)

Hoffman and Singleton introduced the concept of Moore graphs, after Edward Forrest Moore, as graphs attaining this value, known as Moore bound. They also showed that, for D ≥ 2 and Δ ≥ 3, Moore graphs exist for D=2 and Δ =3,7 , and (perhaps) 57. In this context, it is of great interest to find graphs which for a given maximum diameter and maximum degree have a number of vertices as close as possible to the Moore bound.

Download the package, unpack it and open in a browser the file 
 table_degree_diameter.html or the file taula_delta_d.html.

The table in this page gives the state of the art with respect to the LARGEST KNOWN (Δ ,D)-GRAPHS as in May 2024.
Click the position if you wish to know more information: graph construction details, Moore bound, author, references... For most small (&lt; 20000) order values you can download the adjacency list. 
Entries in boldface are optimal.
DOI: 10.17632/d75dzbjd4k.5
title: Table of Large Degree/Diameter Graphs

description: A graph, G=(V,E), consists of a non empty finite set V of elements called vertices and a set E of pairs of elements of V called edges. The number of vertices N=|G|=|V| is the order of the graph. If (x,y) is an edge of E, we say that x and y (or y and x) are adjacent and this is usually written x --&gt; y. It is also said that x and y are the endvertices of the edge (x,y). The degree of a vertex δ(x) is the number of vertices adjacent to x. The degree of G is Δ=max_{x ∈ V} δ(x). A graph is regular of degree Δ or Δ - regular if the degree of all vertices equal Δ. The distance between two vertices x and y, d(x,y) , is the number of edges of a shortest path between x and y , and its maximum value over all pair of vertices, D=max_{x, y ∈ V}d(x,y) , is the diameter of the graph. A (Δ,D) graph is a graph with maximum degree Δ and diameter at most D. The order of a graph with degree Δ, Δ &gt; 2), of diameter D is easily seen to be bounded by

1 + Δ + Δ (Δ-1) + ...+ Δ (Δ-1) D-1 = (Δ (Δ-1)D -2) / (Δ-2) = N(Δ, D)

Hoffman and Singleton introduced the concept of Moore graphs, after Edward Forrest Moore, as graphs attaining this value, known as Moore bound. They also showed that, for D ≥ 2 and Δ ≥ 3, Moore graphs exist for D=2 and Δ =3,7 , and (perhaps) 57. In this context, it is of great interest to find graphs which for a given maximum diameter and maximum degree have a number of vertices as close as possible to the Moore bound.

Download the package, unpack it and open in a browser the file 
 table_degree_diameter.html or the file taula_delta_d.html.

The table in that page gives the state of the art with respect to the LARGEST KNOWN (Δ ,D)-GRAPHS as in March 2025.
Entries in boldface are optimal.
Click the position if you wish to know more information: graph construction details, Moore bound, author, references... For most small (&lt; 20000) order values you can download the adjacency list. 
By clicking on entry (8,3) = 253, you can find a zip file containing the programs used to obtain the results for this graph and for the graphs (3,5), (6,8), (7,6), (7,7), (8,5), (9,4), (10,4), (10,5), (11,5), (12,5), (13,5), (14,5), and (15,5), which were found by the author in 2024. The C program is the same as the one that found this particular entry (8,3) in 1994, with minor output modifications.
DOI: 10.17632/d75dzbjd4k.6
title: Table of Large Degree/Diameter Graphs

description: A graph, G=(V,E), consists of a non empty finite set V of elements called vertices and a set E of pairs of elements of V called edges. The number of vertices N=|G|=|V| is the order of the graph. If (x,y) is an edge of E, we say that x and y (or y and x) are adjacent and this is usually written x --&gt; y. It is also said that x and y are the endvertices of the edge (x,y). The degree of a vertex δ(x) is the number of vertices adjacent to x. The degree of G is Δ=max_{x ∈ V} δ(x). A graph is regular of degree Δ or Δ - regular if the degree of all vertices equal Δ. The distance between two vertices x and y, d(x,y) , is the number of edges of a shortest path between x and y , and its maximum value over all pair of vertices, D=max_{x, y ∈ V}d(x,y) , is the diameter of the graph. A (Δ,D) graph is a graph with maximum degree Δ and diameter at most D. The order of a graph with degree Δ, Δ &gt; 2), of diameter D is easily seen to be bounded by

1 + Δ + Δ (Δ-1) + ...+ Δ (Δ-1) D-1 = (Δ (Δ-1)D -2) / (Δ-2) = N(Δ, D)

Hoffman and Singleton introduced the concept of Moore graphs, after Edward Forrest Moore, as graphs attaining this value, known as Moore bound. They also showed that, for D ≥ 2 and Δ ≥ 3, Moore graphs exist for D=2 and Δ =3,7 , and (perhaps) 57. In this context, it is of great interest to find graphs which for a given maximum diameter and maximum degree have a number of vertices as close as possible to the Moore bound.

Download the package, unpack it and open in a browser the file 
 table_degree_diameter.html or the file taula_delta_d.html.

The table in that page gives the state of the art with respect to the LARGEST KNOWN (Δ ,D)-GRAPHS as in March 2025.
Entries in boldface are optimal.
Click the position if you wish to know more information: graph construction details, Moore bound, author, references... For most small (&lt; 20000) order values you can download the adjacency list. 
By clicking on entry (8,3) = 253, you can find a zip file containing the programs used to obtain the results for this graph and for the graphs (3,5), (6,8), (7,6), (7,7), (8,5), (9,4), (10,4), (10,5), (11,5), (12,5), (13,5), (14,5), and (15,5), which were found by the author in 2024. The C program is the same as the one that found this particular entry (8,3) in 1994, with minor output modifications.
DOI: 10.17632/d75dzbjd4k.7
title: Table of Large Degree/Diameter Graphs

description: A graph, G=(V,E), consists of a non empty finite set V of elements called vertices and a set E of pairs of elements of V called edges. The number of vertices N=|G|=|V| is the order of the graph. If (x,y) is an edge of E, we say that x and y (or y and x) are adjacent and this is usually written x --&gt; y. It is also said that x and y are the endvertices of the edge (x,y). The degree of a vertex δ(x) is the number of vertices adjacent to x. The degree of G is Δ=max_{x ∈ V} δ(x). A graph is regular of degree Δ or Δ - regular if the degree of all vertices equal Δ. The distance between two vertices x and y, d(x,y) , is the number of edges of a shortest path between x and y , and its maximum value over all pair of vertices, D=max_{x, y ∈ V}d(x,y) , is the diameter of the graph. A (Δ,D) graph is a graph with maximum degree Δ and diameter at most D. The order of a graph with degree Δ, Δ &gt; 2), of diameter D is easily seen to be bounded by

1 + Δ + Δ (Δ-1) + ...+ Δ (Δ-1) D-1 = (Δ (Δ-1)D -2) / (Δ-2) = N(Δ, D)

Hoffman and Singleton introduced the concept of Moore graphs, after Edward Forrest Moore, as graphs attaining this value, known as Moore bound. They also showed that, for D ≥ 2 and Δ ≥ 3, Moore graphs exist for D=2 and Δ =3,7 , and (perhaps) 57. In this context, it is of great interest to find graphs which for a given maximum diameter and maximum degree have a number of vertices as close as possible to the Moore bound.

Download the package, unpack it and open in a browser the file 
 table_degree_diameter.html or the file taula_delta_d.html.

The table in that page gives the state of the art with respect to the LARGEST KNOWN (Δ ,D)-GRAPHS as in March 2025.
Entries in boldface are optimal.
Click the position if you wish to know more information: graph construction details, Moore bound, author, references... For most small (&lt; 20000) order values you can download the adjacency list. 
By clicking on entry (8,3) = 253, you can find a zip file containing the programs used to obtain the results for this graph and for the graphs (3,5), (6,8), (7,6), (7,7), (8,5), (9,4), (10,4), (10,5), (11,5), (12,5), (13,5), (14,5), and (15,5), which were found by the author in 2024. The C program is the same as the one that found this particular entry (8,3) in 1994, with minor output modifications.
DOI: 10.17632/d75dzbjd4k.8
title: Table of Large Degree/Diameter Graphs

description: A graph, G=(V,E), consists of a non empty finite set V of elements called vertices and a set E of pairs of elements of V called edges. The number of vertices N=|G|=|V| is the order of the graph. If (x,y) is an edge of E, we say that x and y (or y and x) are adjacent and this is usually written x --&gt; y. It is also said that x and y are the endvertices of the edge (x,y). The degree of a vertex δ(x) is the number of vertices adjacent to x. The degree of G is Δ=max_{x ∈ V} δ(x). A graph is regular of degree Δ or Δ - regular if the degree of all vertices equal Δ. The distance between two vertices x and y, d(x,y) , is the number of edges of a shortest path between x and y , and its maximum value over all pair of vertices, D=max_{x, y ∈ V}d(x,y) , is the diameter of the graph. A (Δ,D) graph is a graph with maximum degree Δ and diameter at most D. The order of a graph with degree Δ, Δ &gt; 2), of diameter D is easily seen to be bounded by

1 + Δ + Δ (Δ-1) + ...+ Δ (Δ-1) D-1 = (Δ (Δ-1)D -2) / (Δ-2) = N(Δ, D)

Hoffman and Singleton introduced the concept of Moore graphs, after Edward Forrest Moore, as graphs attaining this value, known as Moore bound. They also showed that, for D ≥ 2 and Δ ≥ 3, Moore graphs exist for D=2 and Δ =3,7 , and (perhaps) 57. In this context, it is of great interest to find graphs which for a given maximum diameter and maximum degree have a number of vertices as close as possible to the Moore bound.

Download the package, unpack it and open in a browser the file 
 table_degree_diameter.html or the file taula_delta_d.html.

The table in that page gives the state of the art with respect to the LARGEST KNOWN (Δ ,D)-GRAPHS as in March 2025.
Entries in boldface are optimal.
Click the position if you wish to know more information: graph construction details, Moore bound, author, references... For most small (&lt; 20000) order values you can download the adjacency list. 
By clicking on entry (8,3) = 253, you can find a zip file containing the programs used to obtain the results for this graph and for the graphs (3,5), (6,8), (7,6), (7,7), (8,5), (9,4), (10,4), (10,5), (11,5), (12,5), (13,5), (14,5), and (15,5), which were found by the author in 2024. The C program is the same as the one that found this particular entry (8,3) in 1994, with minor output modifications.
DOI: 10.15468/dl.ze9fyw
title: Occurrence Download

description: A dataset containing 390 species occurrences available in GBIF matching the query:
{
 "TaxonKey" : [
 "is Acerodon jubatus (Eschscholtz, 1831)"
 ]
}

 The dataset includes 390 records from 32 constituent datasets; see https://api.gbif.org/v1/occurrence/download/0009481-250415084134356/datasets/export for details.
 
Data from some individual datasets included in this download may be licensed under less restrictive terms.
DOI: 10.15468/dl.8vsqq2
title: Occurrence Download

description: A dataset containing 1674 species occurrences available in GBIF matching the query:
{
 "and" : [
 "Country is France",
 "TaxonKey is Pelagia noctiluca (Forsskål, 1775)"
 ]
}

 The dataset includes 1674 records from 36 constituent datasets; see https://api.gbif.org/v1/occurrence/download/0009482-250415084134356/datasets/export for details.
 
Data from some individual datasets included in this download may be licensed under less restrictive terms.
DOI: 10.15468/dl.9t4dkr
title: Occurrence Download

description: A dataset containing 131152 species occurrences available in GBIF matching the query:
{
 "and" : [
 "HasCoordinate is true",
 "TaxonKey is Aptenodytes forsteri G.R.Gray, 1844"
 ]
}

 The dataset includes 131152 records from 58 constituent datasets; see https://api.gbif.org/v1/occurrence/download/0009468-250415084134356/datasets/export for details.
 
Data from some individual datasets included in this download may be licensed under less restrictive terms.
DOI: 10.5281/zenodo.15075144
title: DATA: Influence of substituent position and pH on organophosphates hydrolysis catalyzed by various nanocrystalline ceria

description: Dataset contains data related to Influence of substituent position and pH on organophosphates hydrolysis catalyzed by various nanocrystalline ceria. Dataset consists of pictures in tiff format and spredsheets and csv format.
description: In this study, we investigated the dephosphorylation of naphthyl phosphate isomers on five different nanocrystalline ceria samples, synthesized using various methods and tested under different pH conditions. 

 

Preparation of nanocrystalline cerium oxides

The five different nanoceria samples were prepared by wet chemical methods from cerium (III) nitrate hexahydrate as the starting precursor, and water was used as the solvent. The individual samples were denoted according to the preparation procedure: Ce-AMN (precipitation with ammonium hydroxide), Ce-CARB (precipitation and annealing of cerium carbonate), Ce-HMT (homogeneous precipitation with hexamethylenetetramine), Ce-PER (refluxing of cerium peroxo-complexes), and Ce-UREA (homogeneous precipitation with urea and annealing).
description: The authors would like to thank the European Commission, Formas, ANR and TACR for funding in the frame of the collaborative international consortium (GreenWaterTech) financed under the 2020 AquaticPollutants Joint call of the AquaticPollutants ERA-NET Cofund (GA Nº 869178). This ERA-NET is an integral part of the activities developed by the Water, Oceans and AMR JPIs. The authors acknowledge the assistance provided by the Research Infrastructure NanoEnviCz, supported by the Ministry of Education, Youth and Sports of the Czech Republic under Project No. LM2023066 and support from the project SP2024/016 and the project CZ.02.1.01/0.0/0.0/17_048/0007399. Supported under the project with No.: UJEP-IGA-JR-2021-44-002-2 by the Internal Grant Agency UJEP.
DOI: 10.5281/zenodo.15075145
title: DATA: Influence of substituent position and pH on organophosphates hydrolysis catalyzed by various nanocrystalline ceria

description: Dataset contains data related to Influence of substituent position and pH on organophosphates hydrolysis catalyzed by various nanocrystalline ceria. Dataset consists of pictures in tiff format and spredsheets and csv format.
description: In this study, we investigated the dephosphorylation of naphthyl phosphate isomers on five different nanocrystalline ceria samples, synthesized using various methods and tested under different pH conditions. 

 

Preparation of nanocrystalline cerium oxides

The five different nanoceria samples were prepared by wet chemical methods from cerium (III) nitrate hexahydrate as the starting precursor, and water was used as the solvent. The individual samples were denoted according to the preparation procedure: Ce-AMN (precipitation with ammonium hydroxide), Ce-CARB (precipitation and annealing of cerium carbonate), Ce-HMT (homogeneous precipitation with hexamethylenetetramine), Ce-PER (refluxing of cerium peroxo-complexes), and Ce-UREA (homogeneous precipitation with urea and annealing).
description: The authors would like to thank the European Commission, Formas, ANR and TACR for funding in the frame of the collaborative international consortium (GreenWaterTech) financed under the 2020 AquaticPollutants Joint call of the AquaticPollutants ERA-NET Cofund (GA Nº 869178). This ERA-NET is an integral part of the activities developed by the Water, Oceans and AMR JPIs. The authors acknowledge the assistance provided by the Research Infrastructure NanoEnviCz, supported by the Ministry of Education, Youth and Sports of the Czech Republic under Project No. LM2023066 and support from the project SP2024/016 and the project CZ.02.1.01/0.0/0.0/17_048/0007399. Supported under the project with No.: UJEP-IGA-JR-2021-44-002-2 by the Internal Grant Agency UJEP.
DOI: 10.15468/dl.e8v77n
title: Occurrence Download

description: A dataset containing 5392 species occurrences available in GBIF matching the query:
{
 "and" : [
 "OccurrenceStatus is Present",
 "TaxonKey is one of (Hylodesmum repandum (Vahl) H.Ohashi & R.R.Mill, Boscia integrifolia Brunner, Boscia coriacea Graells, Abutilon mauritianum (Jacq.) Medik., Aningeria adolfi-friederici (Engl.) Robyns & Gilbert)"
 ]
}

 The dataset includes 5392 records from 167 constituent datasets; see https://api.gbif.org/v1/occurrence/download/0009483-250415084134356/datasets/export for details.
 
Data from some individual datasets included in this download may be licensed under less restrictive terms.
DOI: 10.5281/zenodo.14421913
title: Dataset related to article: A novel missense mutation in the FLNA long isoform expands the phenotypic spectrum of filaminopathies

description: SEQUENCING FILES
DOI: 10.5281/zenodo.14421914
title: Dataset related to article: A novel missense mutation in the FLNA long isoform expands the phenotypic spectrum of filaminopathies

description: SEQUENCING FILES
DOI: 10.17894/ucph.126293a2-481a-4368-b9e4-53a47794cf5a
title: Electrochemical Dissolution: Paths in High-Entropy Alloy Composition Space

description: This archive contains all code and data for reproduction associated with the article "Electrochemical Dissolution: Paths in High-Entropy Alloy Composition Space" (DOI: 10.1007/s44210-025-00057-3).
DOI: 10.5281/zenodo.14809218
title: Predictive Utility of the E-PASS Score for Postoperative Complications in Robot-Assisted Partial Nephrectomy
DOI: 10.5281/zenodo.15260848
title: Predictive Utility of the E-PASS Score for Postoperative Complications in Robot-Assisted Partial Nephrectomy
DOI: 10.5281/zenodo.14809219
title: The Role of the E-PASS Score in Predicting Complications After Robot-Assisted Partial Nephrectomy
DOI: 10.15468/dl.ducemc
title: Occurrence Download

description: A dataset containing 78147 species occurrences available in GBIF matching the query:
{
 "and" : [
 "HasCoordinate is true",
 "HasGeospatialIssue is false",
 "OccurrenceStatus is Present",
 "TaxonKey is Canis lupus Linnaeus, 1758",
 "Year 2015-2025"
 ]
}

 The dataset includes 78147 records from 324 constituent datasets; see https://api.gbif.org/v1/occurrence/download/0009467-250415084134356/datasets/export for details.
 
Data from some individual datasets included in this download may be licensed under less restrictive terms.
DOI: 10.15468/dl.j6zeqh
title: Occurrence Download

description: A dataset containing 5516 species occurrences available in GBIF matching the query:
{
 "and" : [
 "OccurrenceStatus is Present",
 "TaxonKey is one of (Rubus erlangeri Engl., Psophocarpus grandiflorus R.Wilczek, Hylodesmum repandum (Vahl) H.Ohashi & R.R.Mill, Boscia integrifolia Brunner, Boscia coriacea Graells, Abutilon mauritianum (Jacq.) Medik., Aningeria adolfi-friederici (Engl.) Robyns & Gilbert)"
 ]
}

 The dataset includes 5516 records from 168 constituent datasets; see https://api.gbif.org/v1/occurrence/download/0009485-250415084134356/datasets/export for details.
 
Data from some individual datasets included in this download may be licensed under less restrictive terms.