TUTCRIS - Tampereen teknillinen yliopisto

TUTCRIS

Towards detecting structural branching and cyclicity in graphs: A polynomial-based approach

Tutkimustuotosvertaisarvioitu

Standard

Towards detecting structural branching and cyclicity in graphs : A polynomial-based approach. / Dehmer, Matthias; Chen, Zengqiang; Emmert-Streib, Frank; Mowshowitz, Abbe; Shi, Yongtang; Tripathi, Shailesh; Zhang, Yusen.

julkaisussa: Information Sciences, Vuosikerta 471, 01.01.2019, s. 19-28.

Tutkimustuotosvertaisarvioitu

Harvard

Dehmer, M, Chen, Z, Emmert-Streib, F, Mowshowitz, A, Shi, Y, Tripathi, S & Zhang, Y 2019, 'Towards detecting structural branching and cyclicity in graphs: A polynomial-based approach', Information Sciences, Vuosikerta. 471, Sivut 19-28. https://doi.org/10.1016/j.ins.2018.08.043

APA

Dehmer, M., Chen, Z., Emmert-Streib, F., Mowshowitz, A., Shi, Y., Tripathi, S., & Zhang, Y. (2019). Towards detecting structural branching and cyclicity in graphs: A polynomial-based approach. Information Sciences, 471, 19-28. https://doi.org/10.1016/j.ins.2018.08.043

Vancouver

Dehmer M, Chen Z, Emmert-Streib F, Mowshowitz A, Shi Y, Tripathi S et al. Towards detecting structural branching and cyclicity in graphs: A polynomial-based approach. Information Sciences. 2019 tammi 1;471:19-28. https://doi.org/10.1016/j.ins.2018.08.043

Author

Dehmer, Matthias ; Chen, Zengqiang ; Emmert-Streib, Frank ; Mowshowitz, Abbe ; Shi, Yongtang ; Tripathi, Shailesh ; Zhang, Yusen. / Towards detecting structural branching and cyclicity in graphs : A polynomial-based approach. Julkaisussa: Information Sciences. 2019 ; Vuosikerta 471. Sivut 19-28.

Bibtex - Lataa

@article{a5ce2431e45541b782feb84976b6a806,
title = "Towards detecting structural branching and cyclicity in graphs: A polynomial-based approach",
abstract = "Structural properties of graphs and networks have been investigated across scientific disciplines ranging from mathematics to structural chemistry. Structural branching, cyclicity and, more generally, connectedness are well-known examples of such properties. In particular, various graph measures for detecting structural branching and cyclicity have been investigated. These measures are of limited applicability since their interpretation relies heavily on a certain definition of structural branching. In this paper we define a related measure, taking an approach to measurement similar to that of Lov{\'a}sz and Pelik{\'a}n (On the eigenvalues of trees, Periodica Mathematica Hungarica, Vol. 3 (1–2), 1973, 175–182). We define a complex valued polynomial which also has a unique positive root. Analytical and numerical results demonstrate that this measure can be interpreted as a structural branching and cyclicity measure for graphs. Our results generalize the work of Lov{\'a}sz and Pelik{\'a}n since the measure we introduce is not restricted to trees.",
keywords = "Data science, Graphs, Networks, Quantitative graph theory, Structural branching",
author = "Matthias Dehmer and Zengqiang Chen and Frank Emmert-Streib and Abbe Mowshowitz and Yongtang Shi and Shailesh Tripathi and Yusen Zhang",
year = "2019",
month = "1",
day = "1",
doi = "10.1016/j.ins.2018.08.043",
language = "English",
volume = "471",
pages = "19--28",
journal = "Information Sciences",
issn = "0020-0255",
publisher = "Elsevier",

}

RIS (suitable for import to EndNote) - Lataa

TY - JOUR

T1 - Towards detecting structural branching and cyclicity in graphs

T2 - A polynomial-based approach

AU - Dehmer, Matthias

AU - Chen, Zengqiang

AU - Emmert-Streib, Frank

AU - Mowshowitz, Abbe

AU - Shi, Yongtang

AU - Tripathi, Shailesh

AU - Zhang, Yusen

PY - 2019/1/1

Y1 - 2019/1/1

N2 - Structural properties of graphs and networks have been investigated across scientific disciplines ranging from mathematics to structural chemistry. Structural branching, cyclicity and, more generally, connectedness are well-known examples of such properties. In particular, various graph measures for detecting structural branching and cyclicity have been investigated. These measures are of limited applicability since their interpretation relies heavily on a certain definition of structural branching. In this paper we define a related measure, taking an approach to measurement similar to that of Lovász and Pelikán (On the eigenvalues of trees, Periodica Mathematica Hungarica, Vol. 3 (1–2), 1973, 175–182). We define a complex valued polynomial which also has a unique positive root. Analytical and numerical results demonstrate that this measure can be interpreted as a structural branching and cyclicity measure for graphs. Our results generalize the work of Lovász and Pelikán since the measure we introduce is not restricted to trees.

AB - Structural properties of graphs and networks have been investigated across scientific disciplines ranging from mathematics to structural chemistry. Structural branching, cyclicity and, more generally, connectedness are well-known examples of such properties. In particular, various graph measures for detecting structural branching and cyclicity have been investigated. These measures are of limited applicability since their interpretation relies heavily on a certain definition of structural branching. In this paper we define a related measure, taking an approach to measurement similar to that of Lovász and Pelikán (On the eigenvalues of trees, Periodica Mathematica Hungarica, Vol. 3 (1–2), 1973, 175–182). We define a complex valued polynomial which also has a unique positive root. Analytical and numerical results demonstrate that this measure can be interpreted as a structural branching and cyclicity measure for graphs. Our results generalize the work of Lovász and Pelikán since the measure we introduce is not restricted to trees.

KW - Data science

KW - Graphs

KW - Networks

KW - Quantitative graph theory

KW - Structural branching

U2 - 10.1016/j.ins.2018.08.043

DO - 10.1016/j.ins.2018.08.043

M3 - Article

VL - 471

SP - 19

EP - 28

JO - Information Sciences

JF - Information Sciences

SN - 0020-0255

ER -