A graph modelling to measure the frustration index in signed networks

被引：0

作者：

Kizhakekunnel, Germina Augusthy ^{[1
]}

机构：

[1] Cent Univ Kerala, Dept Math, Kasargod, Kerala, India

来源：

ITALIAN JOURNAL OF PURE AND APPLIED MATHEMATICS | 2023年 / 48期

关键词：

frustration index; line index of balance; signed graph; integer programming; optimisation; balance theory;

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Computing the frustration index of a signed graph is a key step towards solving problems in many fields including social networks, political science, physics, chemistry, and biology. In social networks the frustration index determines network distance from a state of structural balance. The focus of this paper is to provide insight into computing the frustration index and show that exact values of the frustration index can be computed using optimisation models namely, 0/1 Binary Linear Model.

引用

页码：605 / 614

页数：10

共 20 条

[1]

ABELSON RP, 1958, BEHAV SCI, V3, P1

[2] SPECTRAL CRITERION FOR CYCLE BALANCE IN NETWORKS [J].

ACHARYA, BD .

JOURNAL OF GRAPH THEORY, 1980, 4 (01) :1-11

[3]

Alon N., 1992, COMB PROBAB COMPUT, V1, P107, DOI [10.1017/S0963548300000122, DOI 10.1017/S0963548300000122]

[4]

[Anonymous], 1963, NORDISK MAT TIDSKRIF

[5]

Aref S, 2019, Arxiv, DOI arXiv:1611.09030

[6] ON THE COMPUTATIONAL-COMPLEXITY OF ISING SPIN-GLASS MODELS [J].

BARAHONA, F .

JOURNAL OF PHYSICS A-MATHEMATICAL AND GENERAL, 1982, 15 (10) :3241-3253

[7] STRUCTURAL BALANCE - A GENERALIZATION OF HEIDER THEORY [J].

CARTWRIGHT, D ;

HARARY, F .

PSYCHOLOGICAL REVIEW, 1956, 63 (05) :277-293

[8]

Coleman T, 2008, LECT NOTES COMPUT SC, V5193, P308, DOI 10.1007/978-3-540-87744-8_26

[9] Bipartivity of fullerene graphs and fullerene stability [J].

Doslic, T .

CHEMICAL PHYSICS LETTERS, 2005, 412 (4-6) :336-340

[10]

Erdos P., 1964, ACTA MATH HUNGAR, V15

← 1 2 →