Difference distance magic oriented graphs

This article introduces difference distance magic (DDM) labelings, a new labeling on oriented graphs. We discuss basic properties of oriented graphs that have a DDM labeling and methods for constructing DDM labelings in a wide variety of oriented graph classes. We also give a variety of oriented gra...

Full description

Saved in:
Bibliographic Details
Published in:Research in the mathematical sciences 2024-12, Vol.11 (4), Article 67
Main Authors: Altman, Kathryn, Calzado, Lauren, Freyberg, Bryan, Kovář, Petr, Lewis, Emma, Marr, Alison, Ross, Lauren, Via, Rowan
Format: Article
Language:English
Subjects:
Applications of Mathematics
Computational Mathematics and Numerical Analysis
Graphs
Labeling
Mathematics
Mathematics and Statistics
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites cdi_FETCH-LOGICAL-c244t-e785ba3418dbbd5d01a5169714e7343734181d6110cca1021eadb19e7798c0673
container_end_page
container_issue 4
container_start_page
container_title Research in the mathematical sciences
container_volume 11
creator Altman, Kathryn
Calzado, Lauren
Freyberg, Bryan
Kovář, Petr
Lewis, Emma
Marr, Alison
Ross, Lauren
Via, Rowan
description This article introduces difference distance magic (DDM) labelings, a new labeling on oriented graphs. We discuss basic properties of oriented graphs that have a DDM labeling and methods for constructing DDM labelings in a wide variety of oriented graph classes. We also give a variety of oriented graph classes that fail to produce a DDM labeling.
doi_str_mv 10.1007/s40687-024-00482-7
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_3124100567</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>3124100567</sourcerecordid><originalsourceid>FETCH-LOGICAL-c244t-e785ba3418dbbd5d01a5169714e7343734181d6110cca1021eadb19e7798c0673</originalsourceid><addsrcrecordid>eNp9kD9PwzAQxS0EElXpF2CKxMRguHOcXDKi8leqxAKz5diXkIomxU4Hvj1Jg8TGdE-6997pfkJcItwgAN1GDXlBEpSWALpQkk7EQmFJsiw0nY46U0oCan0uVjFuAQApT3UKC3F939Y1B-4cJ76Ng53EzjatS_rQcjewT5pg9x_xQpzV9jPy6ncuxfvjw9v6WW5en17WdxvplNaDZCqyyqYaC19VPvOANsO8JNRM40maNuhzRHDOIihk6yssmagsHOSULsXV3LsP_deB42C2_SF040mTotLjx9nRpWaXC32MgWuzD-3Ohm-DYCYqZqZiRirmSMVMoXQOxdHcNRz-qv9J_QDbgWIt</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>3124100567</pqid></control><display><type>article</type><title>Difference distance magic oriented graphs</title><source>Springer Link</source><creator>Altman, Kathryn ; Calzado, Lauren ; Freyberg, Bryan ; Kovář, Petr ; Lewis, Emma ; Marr, Alison ; Ross, Lauren ; Via, Rowan</creator><creatorcontrib>Altman, Kathryn ; Calzado, Lauren ; Freyberg, Bryan ; Kovář, Petr ; Lewis, Emma ; Marr, Alison ; Ross, Lauren ; Via, Rowan</creatorcontrib><description>This article introduces difference distance magic (DDM) labelings, a new labeling on oriented graphs. We discuss basic properties of oriented graphs that have a DDM labeling and methods for constructing DDM labelings in a wide variety of oriented graph classes. We also give a variety of oriented graph classes that fail to produce a DDM labeling.</description><identifier>ISSN: 2522-0144</identifier><identifier>EISSN: 2197-9847</identifier><identifier>DOI: 10.1007/s40687-024-00482-7</identifier><language>eng</language><publisher>Cham: Springer International Publishing</publisher><subject>Applications of Mathematics ; Computational Mathematics and Numerical Analysis ; Graphs ; Labeling ; Mathematics ; Mathematics and Statistics</subject><ispartof>Research in the mathematical sciences, 2024-12, Vol.11 (4), Article 67</ispartof><rights>The Author(s) 2024</rights><rights>The Author(s) 2024. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c244t-e785ba3418dbbd5d01a5169714e7343734181d6110cca1021eadb19e7798c0673</cites><orcidid>0000-0001-7265-8061</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Altman, Kathryn</creatorcontrib><creatorcontrib>Calzado, Lauren</creatorcontrib><creatorcontrib>Freyberg, Bryan</creatorcontrib><creatorcontrib>Kovář, Petr</creatorcontrib><creatorcontrib>Lewis, Emma</creatorcontrib><creatorcontrib>Marr, Alison</creatorcontrib><creatorcontrib>Ross, Lauren</creatorcontrib><creatorcontrib>Via, Rowan</creatorcontrib><title>Difference distance magic oriented graphs</title><title>Research in the mathematical sciences</title><addtitle>Res Math Sci</addtitle><description>This article introduces difference distance magic (DDM) labelings, a new labeling on oriented graphs. We discuss basic properties of oriented graphs that have a DDM labeling and methods for constructing DDM labelings in a wide variety of oriented graph classes. We also give a variety of oriented graph classes that fail to produce a DDM labeling.</description><subject>Applications of Mathematics</subject><subject>Computational Mathematics and Numerical Analysis</subject><subject>Graphs</subject><subject>Labeling</subject><subject>Mathematics</subject><subject>Mathematics and Statistics</subject><issn>2522-0144</issn><issn>2197-9847</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><recordid>eNp9kD9PwzAQxS0EElXpF2CKxMRguHOcXDKi8leqxAKz5diXkIomxU4Hvj1Jg8TGdE-6997pfkJcItwgAN1GDXlBEpSWALpQkk7EQmFJsiw0nY46U0oCan0uVjFuAQApT3UKC3F939Y1B-4cJ76Ng53EzjatS_rQcjewT5pg9x_xQpzV9jPy6ncuxfvjw9v6WW5en17WdxvplNaDZCqyyqYaC19VPvOANsO8JNRM40maNuhzRHDOIihk6yssmagsHOSULsXV3LsP_deB42C2_SF040mTotLjx9nRpWaXC32MgWuzD-3Ohm-DYCYqZqZiRirmSMVMoXQOxdHcNRz-qv9J_QDbgWIt</recordid><startdate>20241201</startdate><enddate>20241201</enddate><creator>Altman, Kathryn</creator><creator>Calzado, Lauren</creator><creator>Freyberg, Bryan</creator><creator>Kovář, Petr</creator><creator>Lewis, Emma</creator><creator>Marr, Alison</creator><creator>Ross, Lauren</creator><creator>Via, Rowan</creator><general>Springer International Publishing</general><general>Springer Nature B.V</general><scope>C6C</scope><scope>AAYXX</scope><scope>CITATION</scope><orcidid>https://orcid.org/0000-0001-7265-8061</orcidid></search><sort><creationdate>20241201</creationdate><title>Difference distance magic oriented graphs</title><author>Altman, Kathryn ; Calzado, Lauren ; Freyberg, Bryan ; Kovář, Petr ; Lewis, Emma ; Marr, Alison ; Ross, Lauren ; Via, Rowan</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c244t-e785ba3418dbbd5d01a5169714e7343734181d6110cca1021eadb19e7798c0673</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Applications of Mathematics</topic><topic>Computational Mathematics and Numerical Analysis</topic><topic>Graphs</topic><topic>Labeling</topic><topic>Mathematics</topic><topic>Mathematics and Statistics</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Altman, Kathryn</creatorcontrib><creatorcontrib>Calzado, Lauren</creatorcontrib><creatorcontrib>Freyberg, Bryan</creatorcontrib><creatorcontrib>Kovář, Petr</creatorcontrib><creatorcontrib>Lewis, Emma</creatorcontrib><creatorcontrib>Marr, Alison</creatorcontrib><creatorcontrib>Ross, Lauren</creatorcontrib><creatorcontrib>Via, Rowan</creatorcontrib><collection>Springer_OA刊</collection><collection>CrossRef</collection><jtitle>Research in the mathematical sciences</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Altman, Kathryn</au><au>Calzado, Lauren</au><au>Freyberg, Bryan</au><au>Kovář, Petr</au><au>Lewis, Emma</au><au>Marr, Alison</au><au>Ross, Lauren</au><au>Via, Rowan</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Difference distance magic oriented graphs</atitle><jtitle>Research in the mathematical sciences</jtitle><stitle>Res Math Sci</stitle><date>2024-12-01</date><risdate>2024</risdate><volume>11</volume><issue>4</issue><artnum>67</artnum><issn>2522-0144</issn><eissn>2197-9847</eissn><abstract>This article introduces difference distance magic (DDM) labelings, a new labeling on oriented graphs. We discuss basic properties of oriented graphs that have a DDM labeling and methods for constructing DDM labelings in a wide variety of oriented graph classes. We also give a variety of oriented graph classes that fail to produce a DDM labeling.</abstract><cop>Cham</cop><pub>Springer International Publishing</pub><doi>10.1007/s40687-024-00482-7</doi><orcidid>https://orcid.org/0000-0001-7265-8061</orcidid><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 2522-0144
ispartof Research in the mathematical sciences, 2024-12, Vol.11 (4), Article 67
issn 2522-0144
2197-9847
language eng
recordid cdi_proquest_journals_3124100567
source Springer Link
subjects Applications of Mathematics
Computational Mathematics and Numerical Analysis
Graphs
Labeling
Mathematics
Mathematics and Statistics
title Difference distance magic oriented graphs
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-24T06%3A07%3A28IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Difference%20distance%20magic%20oriented%20graphs&rft.jtitle=Research%20in%20the%20mathematical%20sciences&rft.au=Altman,%20Kathryn&rft.date=2024-12-01&rft.volume=11&rft.issue=4&rft.artnum=67&rft.issn=2522-0144&rft.eissn=2197-9847&rft_id=info:doi/10.1007/s40687-024-00482-7&rft_dat=%3Cproquest_cross%3E3124100567%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c244t-e785ba3418dbbd5d01a5169714e7343734181d6110cca1021eadb19e7798c0673%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=3124100567&rft_id=info:pmid/&rfr_iscdi=true