Zobrazeno 1 - 10
of 170
pro vyhledávání: '"Yongtang Shi"'
Autor:
Matthias Dehmer, Zengqiang Chen, Frank Emmert-Streib, Abbe Mowshowitz, Kurt Varmuza, Lihua Feng, Herbert Jodlbauer, Yongtang Shi, Jin Tao
Publikováno v:
IEEE Access, Vol 8, Pp 36100-36112 (2020)
Research on the structural complexity of networks has produced many useful results in graph theory and applied disciplines such as engineering and data analysis. This paper is intended as a further contribution to this area of research. Here we focus
Externí odkaz:
https://doaj.org/article/c0e4c525052e454cafd4f2f783133935
Publikováno v:
Symmetry, Vol 14, Iss 6, p 1177 (2022)
Many symmetric properties are well-explored in graph theory, especially in graph coloring, such as symmetric graphs defined by the automorphism groups, symmetric drawing of planar graphs, and symmetric functions which are used to count the number of
Externí odkaz:
https://doaj.org/article/51b4e21162a34a048d7d0f9a2ba899b9
Publikováno v:
Complexity, Vol 2020 (2020)
Externí odkaz:
https://doaj.org/article/e3a963fbcfb74921a713e7abe423c61c
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 21 no. 4, Iss Discrete Algorithms (2019)
Given a graph $G=(V,E)$ and a positive integer $t\geq2$, the task in the vertex cover $P_t$ ($VCP_t$) problem is to find a minimum subset of vertices $F\subseteq V$ such that every path of order $t$ in $G$ contains at least one vertex from $F$. The $
Externí odkaz:
https://doaj.org/article/211f4ea0a3be4a46b3a39f423e7245d5
Autor:
Matthias Dehmer, Zengqiang Chen, Frank Emmert-Streib, Shailesh Tripathi, Abbe Mowshowitz, Alexei Levitchi, Lihua Feng, Yongtang Shi, Jin Tao
Publikováno v:
PLoS ONE, Vol 14, Iss 11, p e0223745 (2019)
In this paper, we define novel graph measures for directed networks. The measures are based on graph polynomials utilizing the out- and in-degrees of directed graphs. Based on these polynomial, we define another polynomial and use their positive zero
Externí odkaz:
https://doaj.org/article/d322d9dd731345c08708aa6df0c056f3
Publikováno v:
Entropy, Vol 17, Iss 6, Pp 3710-3723 (2015)
Shannon entropies for networks have been widely introduced. However, entropies for weighted graphs have been little investigated. Inspired by the work due to Eagle et al., we introduce the concept of graph entropy for special weighted graphs. Further
Externí odkaz:
https://doaj.org/article/f2ddca7ace604d6f9764f40b60ce7dac
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 3, Iss 1, Pp 27-34 (2015)
The matching polynomial of a graph is the generating function of the numbers of its matchings with respect to their cardinality. A graph polynomial is polynomial reconstructible, if its value for a graph can be determined from its values for the vert
Externí odkaz:
https://doaj.org/article/7d29d7b5de994fec9c14ee79c5c92181
Publikováno v:
Entropy, Vol 16, Iss 10, Pp 5416-5427 (2014)
A variety of problems in, e.g., discrete mathematics, computer science, information theory, statistics, chemistry, biology, etc., deal with inferring and characterizing relational structures by using graph measures. In this sense, it has been proven
Externí odkaz:
https://doaj.org/article/d384fc37f1544d0b9ed51bca60c5b9bb
Publikováno v:
PLoS ONE, Vol 11, Iss 12, p e0167075 (2016)
Network structures are everywhere, including but not limited to applications in biological, physical and social sciences, information technology, and optimization. Network robustness is of crucial importance in all such applications. Research on this
Externí odkaz:
https://doaj.org/article/4ecd0d2d872b4ce49a34640f8c3d3c7f
Publikováno v:
PLoS ONE, Vol 10, Iss 10, p e0139265 (2015)
In this paper, we study the discrimination power of graph measures that are based on graph-theoretical matrices. The paper generalizes the work of [M. Dehmer, M. Moosbrugger. Y. Shi, Encoding structural information uniquely with polynomial-based desc
Externí odkaz:
https://doaj.org/article/91244c6377d044a6a47db048886d4699