Exponential generalised network descriptors

Suzana Antunović; Tonči Kokan; Tanja Vojković; Damir Vukičević

doi:10.3934/amc.2019026

Article Contents

2019, Volume 13, Issue 3: 405-420. Doi: 10.3934/amc.2019026

This issue Previous Article Optimal subspace codes in

$ {{\rm{PG}}}(4,q) $

Next Article New non-binary quantum codes from constacyclic codes over

$ \mathbb{F}_q[u,v]/\langle u^{2}-1, v^{2}-v, uv-vu\rangle $

Exponential generalised network descriptors

1.
Faculty of Civil Engineering, Architecture and Geodesy, Matice hrvatske 15, University of Split, Croatia
2.
Faculty of Science, Bijenička cesta 30, University of Zagreb, Croatia
3.
Faculty of Science, Rudera Boškovića 33, University of Split, Croatia

^* Corresponding author
^* Corresponding author

Received: May 2018

Revised: February 2019

Published: August 2019

Abstract / Introduction Full Text(HTML) Figure(1) / Table(1) Related Papers Cited by

Abstract

In communication networks theory the concepts of networkness and network surplus have recently been defined. Together with transmission and betweenness centrality, they were based on the assumption of equal communication between vertices. Generalised versions of these four descriptors were presented, taking into account that communication between vertices $ u $ and $ v $ is decreasing as the distance between them is increasing. Therefore, we weight the quantity of communication by $ \lambda^{d(u,v)} $ where $ \lambda \in \left\langle0,1 \right\rangle $. Extremal values of these descriptors are analysed.

Keywords:

Mathematics Subject Classification: Primary: 58F15, 58F17; Secondary: 53C35.

Citation:

Full Text(HTML)

Figure 1. A broom that minimizes $mt_{\lambda }^{e}(G)$

Download: Full-size image PowerPoint slide

Table 1. Extremal values of exponential generalised network descriptors

Descriptor	$\lambda \in \left\langle 0,1\right\rangle $
	Lower bound	Upper bound
$mt_{\lambda }^{e}$	broom (starting vertex)	complete graph *
	$A_n$	$ (n-1)\lambda $
$Mt_{\lambda }^{e}$	open problem	broom (starting vertex)
		$B_n$
$mc_{\lambda }^{e}$	path (end vertices)	complete graph *
	$\frac{\lambda^D-\lambda}{\lambda -1}$	$(n-1)\lambda $
$Mc_{\lambda }^{e}$	open problem	star (center)
		$(n-1)\left[ \lambda +\frac{1}{2}(n-2)\lambda ^{2}\right] $
$mN_{\lambda }^{e}$	broom (starting vertex)	vertex-transitive graph
	$C_n$	$1$
$MN_{\lambda }^{e}$	vertex-transitive graph	star (center)
	$1$	$\frac{1}{2}(n-2)\lambda +1$
$m\nu _{\lambda }^{e}$	broom (starting vertex)	vertex-transitive graph
	$D_n$	$0$
$M\nu _{\lambda }^{e}$	vertex-transitive graph	star (center)
	$0$	$\frac{1}{2}(n-1)(n-2)\lambda ^{2}$

| Show Table

DownLoad: CSV

Related Papers

Cited by

References

[1]	S. Antunovic, T. Kokan, T. Vojkovic and D. Vukicevic, Generalised network descriptors, Glasnik Matematicki, 48 (2013), 211-230. doi: 10.3336/gm.48.2.01.
[2]	A. L. Barabasi, Linked: How Everything is Connected to Everything Else and What It Means, Persus Publishing, Cambridge, 2002.
[3]	B. Bollobas, Modern Graph Theory, Springer, New York, 1998. doi: 10.1007/978-1-4612-0619-4.
[4]	S. P. Borgatti and M. G. Everett, A graph-theoretic perspective on centrality, Social Networks, 28 (2006), 466-484. doi: 10.1016/j.socnet.2005.11.005.
[5]	U. Brandes, A faster algorithm for betweenness centrality, J. Math. Sociol., 25 (2001), 163-177. doi: 10.1080/0022250X.2001.9990249.
[6]	G. Caporossi, M. Paiva, D. Vukicevic and M. Segatto, Centrality and betweenness: Vertex and edge decomposition of the Wiener index, MATCH Commun. Math. Comput. Chem, 68 (2012), 293-302.
[7]	C. Dangalchev, Residual closeness and generalized closeness, International Journal of Foundations of Computer Science, 22 (2011), 1939-1948. doi: 10.1142/S0129054111009136.
[8]	L. Freeman, A set of measures of centrality based on betweenness, Sociometry, 40 (1977), 35-41. doi: 10.2307/3033543.
[9]	L. Freeman, Centrality in social networks: Conceptual clarification, Social Networks, 1 (1978), 215-239. doi: 10.1016/0378-8733(78)90021-7.
[10]	S. Gago, J. Coroničová Hurajová and T. Mandaras, On decay centrality in graphs, Mathematica Scandinavica, 123 (2018), 39-50. doi: 10.7146/math.scand.a-106210.
[11]	M. O. Jackson and A. Wolinsky, A strategic model of social and economic networks, Journal of Economic Theory, 71 (1996), 44-74. doi: 10.1006/jeth.1996.0108.
[12]	M. E. J. Newman, Networks: An Introduction, Oxford University Press, Oxford, 2010. doi: 10.1093/acprof:oso/9780199206650.001.0001.
[13]	D. Vukicevic and G. Caporossi, Network descriptors based on betweenness centrality and transmission and their extremal values, Discrete Applied Mathematics, 161 (2013), 2678-2686. doi: 10.1016/j.dam.2013.04.005.