On the spectral reconstruction problem for digraphs

The idiosyncratic polynomial of a graph $G$ with adjacency matrix $A$ is the characteristic polynomial of the matrix $ A + y(J-A-I)$, where $I$ is the identity matrix and $J$ is the all-ones matrix. It follows from a theorem of Hagos (2000) combined with an earlier result of Johnson and Newman (1980...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Bankoussou-mabiala, Edward, Boussaïri, Abderrahim, Chaïchaâ, Abdelhak, Chergui, Brahim, Lakhlifi, Soufiane
Format: Artikel
Sprache:eng
Schlagworte:
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 Bankoussou-mabiala, Edward
Boussaïri, Abderrahim
Chaïchaâ, Abdelhak
Chergui, Brahim
Lakhlifi, Soufiane
description The idiosyncratic polynomial of a graph $G$ with adjacency matrix $A$ is the characteristic polynomial of the matrix $ A + y(J-A-I)$, where $I$ is the identity matrix and $J$ is the all-ones matrix. It follows from a theorem of Hagos (2000) combined with an earlier result of Johnson and Newman (1980) that the idiosyncratic polynomial of a graph is reconstructible from the multiset of the idiosyncratic polynomial of its vertex-deleted subgraphs. For a digraph $G$ with adjacency matrix $A$, we define its idiosyncratic polynomial as the characteristic polynomial of the matrix $ A + y(J-A-I)+zA^{T}$. By forbidding two fixed digraphs on three vertices as induced subdigraphs, we prove that the idiosyncratic polynomial of a digraph is reconstructible from the multiset of the idiosyncratic polynomial of its induced subdigraphs on three vertices. As an immediate consequence, the idiosyncratic polynomial of a tournament is reconstructible from the collection of its $3$-cycles. Another consequence is that all the transitive orientations of a comparability graph have the same idiosyncratic polynomial.
doi_str_mv 10.48550/arxiv.1910.13914
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1910_13914</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1910_13914</sourcerecordid><originalsourceid>FETCH-LOGICAL-a674-50c573ba6f9843d423946deed1ba1a27e7e113a8729e7724c29fed92f12a80a3</originalsourceid><addsrcrecordid>eNotzrFuwjAUhWEvDBX0ATrhFwjk2k4cjwhBWwmJAfboxr6GSCGJbgKib98WmI70D0efEB-QLkyRZekS-V7fFuD-AmgH5k3ofSvHM8mhJz8yNpLJd-0w8tWPddfKnruqoYuMHctQnxj78zATk4jNQO-vnYrDdnNcfyW7_ef3erVLMLcmyVKfWV1hHl1hdDBKO5MHogAVAipLlgA0FlY5slYZr1yk4FQEhUWKeirmz9cHuuy5viD_lP_48oHXvwr-Pv0</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>On the spectral reconstruction problem for digraphs</title><source>arXiv.org</source><creator>Bankoussou-mabiala, Edward ; Boussaïri, Abderrahim ; Chaïchaâ, Abdelhak ; Chergui, Brahim ; Lakhlifi, Soufiane</creator><creatorcontrib>Bankoussou-mabiala, Edward ; Boussaïri, Abderrahim ; Chaïchaâ, Abdelhak ; Chergui, Brahim ; Lakhlifi, Soufiane</creatorcontrib><description>The idiosyncratic polynomial of a graph $G$ with adjacency matrix $A$ is the characteristic polynomial of the matrix $ A + y(J-A-I)$, where $I$ is the identity matrix and $J$ is the all-ones matrix. It follows from a theorem of Hagos (2000) combined with an earlier result of Johnson and Newman (1980) that the idiosyncratic polynomial of a graph is reconstructible from the multiset of the idiosyncratic polynomial of its vertex-deleted subgraphs. For a digraph $G$ with adjacency matrix $A$, we define its idiosyncratic polynomial as the characteristic polynomial of the matrix $ A + y(J-A-I)+zA^{T}$. By forbidding two fixed digraphs on three vertices as induced subdigraphs, we prove that the idiosyncratic polynomial of a digraph is reconstructible from the multiset of the idiosyncratic polynomial of its induced subdigraphs on three vertices. As an immediate consequence, the idiosyncratic polynomial of a tournament is reconstructible from the collection of its $3$-cycles. Another consequence is that all the transitive orientations of a comparability graph have the same idiosyncratic polynomial.</description><identifier>DOI: 10.48550/arxiv.1910.13914</identifier><language>eng</language><subject>Mathematics - Combinatorics</subject><creationdate>2019-10</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.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,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1910.13914$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1910.13914$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Bankoussou-mabiala, Edward</creatorcontrib><creatorcontrib>Boussaïri, Abderrahim</creatorcontrib><creatorcontrib>Chaïchaâ, Abdelhak</creatorcontrib><creatorcontrib>Chergui, Brahim</creatorcontrib><creatorcontrib>Lakhlifi, Soufiane</creatorcontrib><title>On the spectral reconstruction problem for digraphs</title><description>The idiosyncratic polynomial of a graph $G$ with adjacency matrix $A$ is the characteristic polynomial of the matrix $ A + y(J-A-I)$, where $I$ is the identity matrix and $J$ is the all-ones matrix. It follows from a theorem of Hagos (2000) combined with an earlier result of Johnson and Newman (1980) that the idiosyncratic polynomial of a graph is reconstructible from the multiset of the idiosyncratic polynomial of its vertex-deleted subgraphs. For a digraph $G$ with adjacency matrix $A$, we define its idiosyncratic polynomial as the characteristic polynomial of the matrix $ A + y(J-A-I)+zA^{T}$. By forbidding two fixed digraphs on three vertices as induced subdigraphs, we prove that the idiosyncratic polynomial of a digraph is reconstructible from the multiset of the idiosyncratic polynomial of its induced subdigraphs on three vertices. As an immediate consequence, the idiosyncratic polynomial of a tournament is reconstructible from the collection of its $3$-cycles. Another consequence is that all the transitive orientations of a comparability graph have the same idiosyncratic polynomial.</description><subject>Mathematics - Combinatorics</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotzrFuwjAUhWEvDBX0ATrhFwjk2k4cjwhBWwmJAfboxr6GSCGJbgKib98WmI70D0efEB-QLkyRZekS-V7fFuD-AmgH5k3ofSvHM8mhJz8yNpLJd-0w8tWPddfKnruqoYuMHctQnxj78zATk4jNQO-vnYrDdnNcfyW7_ef3erVLMLcmyVKfWV1hHl1hdDBKO5MHogAVAipLlgA0FlY5slYZr1yk4FQEhUWKeirmz9cHuuy5viD_lP_48oHXvwr-Pv0</recordid><startdate>20191030</startdate><enddate>20191030</enddate><creator>Bankoussou-mabiala, Edward</creator><creator>Boussaïri, Abderrahim</creator><creator>Chaïchaâ, Abdelhak</creator><creator>Chergui, Brahim</creator><creator>Lakhlifi, Soufiane</creator><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20191030</creationdate><title>On the spectral reconstruction problem for digraphs</title><author>Bankoussou-mabiala, Edward ; Boussaïri, Abderrahim ; Chaïchaâ, Abdelhak ; Chergui, Brahim ; Lakhlifi, Soufiane</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a674-50c573ba6f9843d423946deed1ba1a27e7e113a8729e7724c29fed92f12a80a3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Mathematics - Combinatorics</topic><toplevel>online_resources</toplevel><creatorcontrib>Bankoussou-mabiala, Edward</creatorcontrib><creatorcontrib>Boussaïri, Abderrahim</creatorcontrib><creatorcontrib>Chaïchaâ, Abdelhak</creatorcontrib><creatorcontrib>Chergui, Brahim</creatorcontrib><creatorcontrib>Lakhlifi, Soufiane</creatorcontrib><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Bankoussou-mabiala, Edward</au><au>Boussaïri, Abderrahim</au><au>Chaïchaâ, Abdelhak</au><au>Chergui, Brahim</au><au>Lakhlifi, Soufiane</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On the spectral reconstruction problem for digraphs</atitle><date>2019-10-30</date><risdate>2019</risdate><abstract>The idiosyncratic polynomial of a graph $G$ with adjacency matrix $A$ is the characteristic polynomial of the matrix $ A + y(J-A-I)$, where $I$ is the identity matrix and $J$ is the all-ones matrix. It follows from a theorem of Hagos (2000) combined with an earlier result of Johnson and Newman (1980) that the idiosyncratic polynomial of a graph is reconstructible from the multiset of the idiosyncratic polynomial of its vertex-deleted subgraphs. For a digraph $G$ with adjacency matrix $A$, we define its idiosyncratic polynomial as the characteristic polynomial of the matrix $ A + y(J-A-I)+zA^{T}$. By forbidding two fixed digraphs on three vertices as induced subdigraphs, we prove that the idiosyncratic polynomial of a digraph is reconstructible from the multiset of the idiosyncratic polynomial of its induced subdigraphs on three vertices. As an immediate consequence, the idiosyncratic polynomial of a tournament is reconstructible from the collection of its $3$-cycles. Another consequence is that all the transitive orientations of a comparability graph have the same idiosyncratic polynomial.</abstract><doi>10.48550/arxiv.1910.13914</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.1910.13914
ispartof
issn
language eng
recordid cdi_arxiv_primary_1910_13914
source arXiv.org
subjects Mathematics - Combinatorics
title On the spectral reconstruction problem for digraphs
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-22T22%3A06%3A32IST&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=On%20the%20spectral%20reconstruction%20problem%20for%20digraphs&rft.au=Bankoussou-mabiala,%20Edward&rft.date=2019-10-30&rft_id=info:doi/10.48550/arxiv.1910.13914&rft_dat=%3Carxiv_GOX%3E1910_13914%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