2018-07
AUTHORSRichard H. Hammack, Paul C. Kainen
ABSTRACTGiven two cycles A and B in a graph, such that A∩B is a non-trivial path, the connected sumA+^B is the cycle whose edges are the symmetric difference of E(A) and E(B). A special kind of cycle basis for a graph, a connected sum basis, is defined. Such a basis has the property that a hierarchical method, building successive cycles through connected sum, eventually reaches all the cycles of the graph. It is proved that every graph has a connected sum basis. A property is said to be cooperative if it holds for the connected sum of two cycles when it holds for the summands. Cooperative properties that hold for the cycles of a connected sum basis will hold for all cycles in the graph. As an application, commutativity of a groupoid diagram follows from commutativity of a connected sum basis for the underlying graph of the diagram. An example is given of a noncommutative diagram with a (non-connected sum) basis of cycles which do commute. More... »
PAGES523-534
http://scigraph.springernature.com/pub.10.1007/s00373-018-1891-y
DOIhttp://dx.doi.org/10.1007/s00373-018-1891-y
DIMENSIONShttps://app.dimensions.ai/details/publication/pub.1103160701
JSON-LD is the canonical representation for SciGraph data.
TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT
[
{
"@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json",
"about": [
{
"id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0601",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Biochemistry and Cell Biology",
"type": "DefinedTerm"
},
{
"id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/06",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Biological Sciences",
"type": "DefinedTerm"
}
],
"author": [
{
"affiliation": {
"name": [
"Department of Mathematics, Box 2014, Virginia Commonwealth University, 23284, Richmond, VA, USA"
],
"type": "Organization"
},
"familyName": "Hammack",
"givenName": "Richard H.",
"id": "sg:person.013256044651.37",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013256044651.37"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Georgetown University",
"id": "https://www.grid.ac/institutes/grid.213910.8",
"name": [
"Department of Mathematics and Statistics, Georgetown University, 37th and O Streets, N.W., 20057, Washington, DC, USA"
],
"type": "Organization"
},
"familyName": "Kainen",
"givenName": "Paul C.",
"id": "sg:person.013607306243.38",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013607306243.38"
],
"type": "Person"
}
],
"citation": [
{
"id": "https://doi.org/10.1002/net.3230060206",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1006560158"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1002/(sici)1097-0118(199610)23:2<175::aid-jgt8>3.0.co;2-q",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1011438013"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1016/j.difgeo.2015.03.001",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1016102342"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1090/s0002-9947-1932-1501641-2",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1025837595"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1016/s0012-365x(00)00236-3",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1036186631"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1016/j.dam.2008.06.047",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1039156476"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1103/physreve.73.025101",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1044622704"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1103/physreve.73.025101",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1044622704"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.2307/2372800",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1069899417"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1016/j.dam.2017.10.001",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1092482649"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.26493/1855-3974.450.0b6",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1106240193"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.26493/1855-3974.104.5b7",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1106306910"
],
"type": "CreativeWork"
}
],
"datePublished": "2018-07",
"datePublishedReg": "2018-07-01",
"description": "Given two cycles A and B in a graph, such that A\u2229B is a non-trivial path, the connected sumA+^B is the cycle whose edges are the symmetric difference of E(A) and E(B). A special kind of cycle basis for a graph, a connected sum basis, is defined. Such a basis has the property that a hierarchical method, building successive cycles through connected sum, eventually reaches all the cycles of the graph. It is proved that every graph has a connected sum basis. A property is said to be cooperative if it holds for the connected sum of two cycles when it holds for the summands. Cooperative properties that hold for the cycles of a connected sum basis will hold for all cycles in the graph. As an application, commutativity of a groupoid diagram follows from commutativity of a connected sum basis for the underlying graph of the diagram. An example is given of a noncommutative diagram with a (non-connected sum) basis of cycles which do commute.",
"genre": "research_article",
"id": "sg:pub.10.1007/s00373-018-1891-y",
"inLanguage": [
"en"
],
"isAccessibleForFree": false,
"isPartOf": [
{
"id": "sg:journal.1136071",
"issn": [
"0911-0119",
"1435-5914"
],
"name": "Graphs and Combinatorics",
"type": "Periodical"
},
{
"issueNumber": "4",
"type": "PublicationIssue"
},
{
"type": "PublicationVolume",
"volumeNumber": "34"
}
],
"name": "Graph Bases and Diagram Commutativity",
"pagination": "523-534",
"productId": [
{
"name": "readcube_id",
"type": "PropertyValue",
"value": [
"18f7c6ebf44be0de73ac7207e2021c48ef6e3e081d6269a961e0fc455d10c904"
]
},
{
"name": "doi",
"type": "PropertyValue",
"value": [
"10.1007/s00373-018-1891-y"
]
},
{
"name": "dimensions_id",
"type": "PropertyValue",
"value": [
"pub.1103160701"
]
}
],
"sameAs": [
"https://doi.org/10.1007/s00373-018-1891-y",
"https://app.dimensions.ai/details/publication/pub.1103160701"
],
"sdDataset": "articles",
"sdDatePublished": "2019-04-11T14:17",
"sdLicense": "https://scigraph.springernature.com/explorer/license/",
"sdPublisher": {
"name": "Springer Nature - SN SciGraph project",
"type": "Organization"
},
"sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000372_0000000372/records_117097_00000003.jsonl",
"type": "ScholarlyArticle",
"url": "https://link.springer.com/10.1007%2Fs00373-018-1891-y"
}
]Download the RDF metadata as: json-ld nt turtle xml License info
JSON-LD is a popular format for linked data which is fully compatible with JSON.
curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/s00373-018-1891-y'
N-Triples is a line-based linked data format ideal for batch operations.
curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/s00373-018-1891-y'
Turtle is a human-readable linked data format.
curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/s00373-018-1891-y'
RDF/XML is a standard XML format for linked data.
curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/s00373-018-1891-y'
This table displays all metadata directly associated to this object as RDF triples.
103 TRIPLES
21 PREDICATES
38 URIs
19 LITERALS
7 BLANK NODES