The following pages link to Abbe Mowshowitz (Q237611):
Displaying 34 items.
- The Hosoya entropy of a graph (Q296523) (← links)
- An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants (Q360469) (← links)
- Entropy and the complexity of graphs revisited (Q406027) (← links)
- Bounds on the moduli of polynomial zeros (Q426947) (← links)
- A history of graph entropy measures (Q621629) (← links)
- Discrimination power of graph measures based on complex zeros of the partial Hosoya polynomial (Q902842) (← links)
- Inequalities for entropy-based measures of network information content (Q961624) (← links)
- The group and the minimal polynomial of a graph (Q1148337) (← links)
- Hosoya entropy of fullerene graphs (Q2010674) (← links)
- Relations and bounds for the zeros of graph polynomials using vertex orbits (Q2180690) (← links)
- Towards detecting structural branching and cyclicity in graphs: a polynomial-based approach (Q2200659) (← links)
- On the degeneracy of the Randić entropy and related graph measures (Q2224838) (← links)
- On efficient network similarity measures (Q2286037) (← links)
- Properties of graph distance measures by means of discrete inequalities (Q2295900) (← links)
- A note on distance-based entropy of dendrimers (Q2306633) (← links)
- A calculus for measuring the elegance of abstract graphs (Q2422969) (← links)
- The characteristic polynomial of a graph (Q2544589) (← links)
- (Q2906533) (← links)
- (Q4075500) (← links)
- (Q4085747) (← links)
- Line minimal Boolean forests (Q4154573) (← links)
- (Q4561603) (← links)
- Entropy of Digraphs and Infinite Networks (Q4900003) (← links)
- Entropy and the complexity of graphs: I. An index of the relative complexity of a graph (Q5552105) (← links)
- Entropy and the complexity of graphs: II. The information content of digraphs and infinite graphs (Q5552106) (← links)
- Entropy and the complexity of graphs: III. Graphs with prescribed information content (Q5552107) (← links)
- Labeled trees with unlabeled end-points (Q5565630) (← links)
- (Q5588441) (← links)
- Entropy and the complexity of graphs: IV. Entropy measures and graphical structure (Q5602690) (← links)
- Cospectral Graphs and Digraphs (Q5629664) (← links)
- (Q5672666) (← links)
- Assessing bias in search engines (Q5959167) (← links)
- Relationships between symmetry-based graph measures (Q6139463) (← links)
- On the relationship between PageRank and automorphisms of a graph (Q6186845) (← links)
