About: 110-vertex Iofinova-Ivanov graph

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

About: 110-vertex Iofinova-Ivanov graph Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : dbpedia.org associated with source document(s)
QRcode icon

http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2F110-vertex_Iofinova-Ivanov_graph&graph=http%3A%2F%2Fdbpedia.org&graph=http%3A%2F%2Fdbpedia.org

The 110-vertex Iofinova-Ivanov graph is, in graph theory, a semi-symmetric cubic graph with 110 vertices and 165 edges.

Attributes	Values
rdfs:label	110-vertex Iofinova-Ivanov graph (en) 110-graphe de Iofinova-Ivanov (fr) 110-вершинный граф Иванова — Иофиновой (ru)
rdfs:comment	The 110-vertex Iofinova-Ivanov graph is, in graph theory, a semi-symmetric cubic graph with 110 vertices and 165 edges. (en) Le 110-graphe de Iofinova-Ivanov est, en théorie des graphes, un graphe 3-régulier possédant 110 sommets et 165 arêtes. (fr) 110-вершинный граф Иванова — Иофиновой — это полусимметричный кубический граф с 110 вершинами и 165 рёбрами. (ru)
name	110 (xsd:integer)
foaf:depiction
dcterms:subject	Individual graphs Regular graphs
Wikipage page ID	47498392 (xsd:integer)
Wikipage revision ID	994823716 (xsd:integer)
Link from a Wikipage to another Wikipage	Characteristic polynomial Cubic graph Individual graphs Regular graphs Connectivity (graph theory) Girth (graph theory) Graph coloring Ljubljana graph Edge coloring Folkman graph Graph theory Gray graph Primitive permutation group Projective linear group Hamiltonian path Bipartite graph Distance (graph theory) Tutte 12-cage Semi-symmetric graph
sameAs	110-vertex Iofinova-Ivanov graph 110-vertex Iofinova-Ivanov graph 110-vertex Iofinova-Ivanov graph 110-vertex Iofinova-Ivanov graph 110-vertex Iofinova-Ivanov graph
dbp:wikiPageUsesTemplate	dbt:Infobox_graph dbt:Reflist
thumbnail	wiki-commons:Special:FilePath/110_vertex_Iofinova_Ivanov_graph.svg?width=300
automorphisms	1320 (xsd:integer)
chromatic index	3 (xsd:integer)
chromatic number	2 (xsd:integer)
diameter	7 (xsd:integer)
edges	165 (xsd:integer)
girth	10 (xsd:integer)
properties	Cubic graph Hamiltonian path Bipartite graph Semi-symmetric graph
radius	7 (xsd:integer)
vertices	110 (xsd:integer)
has abstract	The 110-vertex Iofinova-Ivanov graph is, in graph theory, a semi-symmetric cubic graph with 110 vertices and 165 edges. (en) Le 110-graphe de Iofinova-Ivanov est, en théorie des graphes, un graphe 3-régulier possédant 110 sommets et 165 arêtes. (fr) 110-вершинный граф Иванова — Иофиновой — это полусимметричный кубический граф с 110 вершинами и 165 рёбрами. (ru)
prov:wasDerivedFrom	wikipedia-en:110-vertex_Iofinova-Ivanov_graph?oldid=994823716&ns=0
page length (characters) of wiki page	5135 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:110-vertex_Iofinova-Ivanov_graph
is Link from a Wikipage to another Wikipage of	List of graphs by edges and vertices Ljubljana graph Tutte 12-cage
is foaf:primaryTopic of	wikipedia-en:110-vertex_Iofinova-Ivanov_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 (62 GB total memory, 47 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software