"Mowshowitz, Abbe" - Selaus tekijän mukaan TUNICRIS-julkaisut

Viitteet 1-9 / 9

    • The Hosoya entropy of graphs revisited 

      Ghorbani, Modjtaba; Dehmer, Matthias; Mowshowitz, Abbe; Tao, Jin; Emmert-Streib, Frank (2019)
      article
      In this paper we extend earlier results on Hosoya entropy (H-entropy) of graphs, and establish connections between H-entropy and automorphisms of graphs. In particular, we determine the H-entropy of graphs whose automorphism ...

    • Measuring the complexity of directed graphs : A polynomial-based approach 

      Dehmer, Matthias; Chen, Zengqiang; Emmert-Streib, Frank; Tripathi, Shailesh; Mowshowitz, Abbe; Levitchi, Alexei; Feng, Lihua; Shi, Yongtang; Tao, Jin (14.11.2019)
      article
      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 ...

    • A note on distance-based entropy of dendrimers 

      Ghorbani, Modjtaba; Dehmer, Matthias; Zangi, Samaneh; Mowshowitz, Abbe; Emmert-Streib, Frank (2019)
      article
      This paper introduces a variant of entropy measures based on vertex eccentricity and applies it to all graphs representing the isomers of octane. Taking into account the vertex degree as well (degree-ecc-entropy), we find ...

    • A Note on Graphs with Prescribed Orbit Structure 

      Mowshowitz, Abbe; Dehmer, Matthias; Emmert-Streib, Frank (15.11.2019)
      article
      This paper presents a proof of the existence of connected, undirected graphs with prescribed orbit structure, giving an explicit construction procedure for these graphs. Trees with prescribed orbit structure are also investigated.

    • On properties of distance-based entropies on fullerene graphs 

      Ghorbani, Modjtaba; Dehmer, Matthias; Rajabi-Parsa, Mina; Mowshowitz, Abbe; Emmert-Streib, Frank (01.05.2019)
      article
      In this paper, we study several distance-based entropy measures on fullerene graphs. These include the topological information content of a graph Iα(G), a degree-based entropy measure, the eccentric-entropy I fσ(G), the ...

    • On the relationship between PageRank and automorphisms of a graph 

      Ghorbani, Modjtaba; Dehmer, Matthias; Lotfi, Abdullah; Amraei, Najaf; Mowshowitz, Abbe; Emmert-Streib, Frank (2021)
      article
      PageRank is an algorithm used in Internet search to score the importance of web pages. The aim of this paper is demonstrate some new results concerning the relationship between the concept of PageRank and automorphisms of ...

    • The orbit-polynomial : A novel measure of symmetry in networks 

      Dehmer, Matthias; Chen, Zengqiang; Emmert-Streib, Frank; Mowshowitz, Abbe; Varmuza, Kurt; Feng, Lihua; Jodlbauer, Herbert; Shi, Yongtang; Tao, Jin (2020)
      article
      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 ...

    • Relationships between symmetry-based graph measures 

      Ma, Yuede; Dehmer, Matthias; Künzi, Urs Martin; Mowshowitz, Abbe; Tripathi, Shailesh; Ghorbani, Modjtaba; Emmert-Streib, Frank (2021)
      article
      This paper addresses the problem of comparing different measures of graph symmetry. Two measures, each based on the number and respective sizes of the vertex orbits of the automorphism group or a graph, are compared. A ...

    • Toward measuring network aesthetics based on symmetry 

      Chen, Zengqiang; Dehmer, Matthias; Emmert-Streib, Frank; Mowshowitz, Abbe; Shi, Yongtang (01.06.2017)
      article
      In this exploratory paper, we discuss quantitative graph-theoretical measures of network aesthetics. Related work in this area has typically focused on geometrical features (e.g., line crossings or edge bendiness) of ...