Delta invariant for Eulerian digraphs

Sheng Chen; Yi Dai

doi:10.1016/j.tcs.2022.06.016

Delta invariant for Eulerian digraphs

Sheng Chen
, Yi Dai^*

^*Corresponding author for this work

School of Mathematics

Harbin Institute of Technology

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

Abstract

For a connected Eulerian digraph, we define a delta invariant by its Laplacian matrix. We present characterizations and algorithms for it. We also compute delta invariant for some examples to illustrate its applications.

Original language	English
Pages (from-to)	94-103
Number of pages	10
Journal	Theoretical Computer Science
Volume	928
DOIs	https://doi.org/10.1016/j.tcs.2022.06.016
State	Published - 3 Sep 2022

Keywords

Graph cut
Laplacian matrix
Variational characterization

Access to Document

10.1016/j.tcs.2022.06.016

Cite this

@article{f0ce119518354ce59f0989f849394b6e,

title = "Delta invariant for Eulerian digraphs",

abstract = "For a connected Eulerian digraph, we define a delta invariant by its Laplacian matrix. We present characterizations and algorithms for it. We also compute delta invariant for some examples to illustrate its applications.",

keywords = "Graph cut, Laplacian matrix, Variational characterization",

author = "Sheng Chen and Yi Dai",

note = "Publisher Copyright: {\textcopyright} 2022 Elsevier B.V.",

year = "2022",

month = sep,

day = "3",

doi = "10.1016/j.tcs.2022.06.016",

language = "英语",

volume = "928",

pages = "94--103",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - Delta invariant for Eulerian digraphs

AU - Chen, Sheng

AU - Dai, Yi

PY - 2022/9/3

Y1 - 2022/9/3

N2 - For a connected Eulerian digraph, we define a delta invariant by its Laplacian matrix. We present characterizations and algorithms for it. We also compute delta invariant for some examples to illustrate its applications.

AB - For a connected Eulerian digraph, we define a delta invariant by its Laplacian matrix. We present characterizations and algorithms for it. We also compute delta invariant for some examples to illustrate its applications.

KW - Graph cut

KW - Laplacian matrix

KW - Variational characterization

UR - https://www.scopus.com/pages/publications/85132526455

U2 - 10.1016/j.tcs.2022.06.016

DO - 10.1016/j.tcs.2022.06.016

M3 - 文章

AN - SCOPUS:85132526455

SN - 0304-3975

VL - 928

SP - 94

EP - 103

JO - Theoretical Computer Science

JF - Theoretical Computer Science

ER -

Delta invariant for Eulerian digraphs

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this