Hermitian adjacency matrices of mixed multigraphs

Hermitian adjacency matrices of mixed multigraphs

A mixed multigraph is obtained from an undirected multigraph by orienting a subset of its edges. In this paper, we study a new Hermitian matrix representation of mixed multigraphs, give an introduction to cospectral operations on mixed multigraphs, and characterize switching equivalent mixed multigr...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Yuan, Bo-Jun, Sun, Shaowei, Wang, Dijian
Format: Artikel
Sprache:eng
Schlagworte:
Mathematics - Combinatorics
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Yuan, Bo-Jun
Sun, Shaowei
Wang, Dijian
description A mixed multigraph is obtained from an undirected multigraph by orienting a subset of its edges. In this paper, we study a new Hermitian matrix representation of mixed multigraphs, give an introduction to cospectral operations on mixed multigraphs, and characterize switching equivalent mixed multigraphs in terms of fundamental cycle basis. As an application, an upper bound of cospectral classes of mixed multigraphs with the same underlying graph is obtained.
doi_str_mv 10.48550/arxiv.2206.12777
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2206_12777</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2206_12777</sourcerecordid><originalsourceid>FETCH-LOGICAL-a677-7dcc3d283be37c26c1a643f849814fd8a141483a4839019b84090927683ce4943</originalsourceid><addsrcrecordid>eNotzr1uwjAYhWEvHSrKBXTCN5DUPx_-GStUCFIkFvbow3bACFPkBETunjYwHL3b0UPIJ2clmPmcfWG-x1spBFMlF1rrd8KrkFPsI54p-iO6cHYDTdjn6EJHf1ua4j14mq6nPu4zXg7dB3lr8dSF6asTsl3-bBdVUW9W68V3XaDSutDeOemFkbsgtRPKcVQgWwPWcGi9QQ4cjMS_WcbtzgCzzAqtjHQBLMgJmT1vR3NzyTFhHpp_ezPa5QN7QT1d</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Hermitian adjacency matrices of mixed multigraphs</title><source>arXiv.org</source><creator>Yuan, Bo-Jun ; Sun, Shaowei ; Wang, Dijian</creator><creatorcontrib>Yuan, Bo-Jun ; Sun, Shaowei ; Wang, Dijian</creatorcontrib><description>A mixed multigraph is obtained from an undirected multigraph by orienting a subset of its edges. In this paper, we study a new Hermitian matrix representation of mixed multigraphs, give an introduction to cospectral operations on mixed multigraphs, and characterize switching equivalent mixed multigraphs in terms of fundamental cycle basis. As an application, an upper bound of cospectral classes of mixed multigraphs with the same underlying graph is obtained.</description><identifier>DOI: 10.48550/arxiv.2206.12777</identifier><language>eng</language><subject>Mathematics - Combinatorics</subject><creationdate>2022-06</creationdate><rights>http://creativecommons.org/licenses/by/4.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2206.12777$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2206.12777$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Yuan, Bo-Jun</creatorcontrib><creatorcontrib>Sun, Shaowei</creatorcontrib><creatorcontrib>Wang, Dijian</creatorcontrib><title>Hermitian adjacency matrices of mixed multigraphs</title><description>A mixed multigraph is obtained from an undirected multigraph by orienting a subset of its edges. In this paper, we study a new Hermitian matrix representation of mixed multigraphs, give an introduction to cospectral operations on mixed multigraphs, and characterize switching equivalent mixed multigraphs in terms of fundamental cycle basis. As an application, an upper bound of cospectral classes of mixed multigraphs with the same underlying graph is obtained.</description><subject>Mathematics - Combinatorics</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotzr1uwjAYhWEvHSrKBXTCN5DUPx_-GStUCFIkFvbow3bACFPkBETunjYwHL3b0UPIJ2clmPmcfWG-x1spBFMlF1rrd8KrkFPsI54p-iO6cHYDTdjn6EJHf1ua4j14mq6nPu4zXg7dB3lr8dSF6asTsl3-bBdVUW9W68V3XaDSutDeOemFkbsgtRPKcVQgWwPWcGi9QQ4cjMS_WcbtzgCzzAqtjHQBLMgJmT1vR3NzyTFhHpp_ezPa5QN7QT1d</recordid><startdate>20220625</startdate><enddate>20220625</enddate><creator>Yuan, Bo-Jun</creator><creator>Sun, Shaowei</creator><creator>Wang, Dijian</creator><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20220625</creationdate><title>Hermitian adjacency matrices of mixed multigraphs</title><author>Yuan, Bo-Jun ; Sun, Shaowei ; Wang, Dijian</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a677-7dcc3d283be37c26c1a643f849814fd8a141483a4839019b84090927683ce4943</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Mathematics - Combinatorics</topic><toplevel>online_resources</toplevel><creatorcontrib>Yuan, Bo-Jun</creatorcontrib><creatorcontrib>Sun, Shaowei</creatorcontrib><creatorcontrib>Wang, Dijian</creatorcontrib><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Yuan, Bo-Jun</au><au>Sun, Shaowei</au><au>Wang, Dijian</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Hermitian adjacency matrices of mixed multigraphs</atitle><date>2022-06-25</date><risdate>2022</risdate><abstract>A mixed multigraph is obtained from an undirected multigraph by orienting a subset of its edges. In this paper, we study a new Hermitian matrix representation of mixed multigraphs, give an introduction to cospectral operations on mixed multigraphs, and characterize switching equivalent mixed multigraphs in terms of fundamental cycle basis. As an application, an upper bound of cospectral classes of mixed multigraphs with the same underlying graph is obtained.</abstract><doi>10.48550/arxiv.2206.12777</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2206.12777
ispartof
issn
language eng
recordid cdi_arxiv_primary_2206_12777
source arXiv.org
subjects Mathematics - Combinatorics
title Hermitian adjacency matrices of mixed multigraphs
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-22T23%3A20%3A22IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Hermitian%20adjacency%20matrices%20of%20mixed%20multigraphs&rft.au=Yuan,%20Bo-Jun&rft.date=2022-06-25&rft_id=info:doi/10.48550/arxiv.2206.12777&rft_dat=%3Carxiv_GOX%3E2206_12777%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true