1 citations · 1 across the 12 of their papers we have counts for
6 papers · 1 filter
A novel method for assessing and measuring homophily in networks through second-order statistics
Nicola Apollonio, Paolo Giulio Franciosa, Daniele Santoni
We present a new method for assessing and measuring homophily in networks whose nodes have categorical attributes, namely when the nodes of networks come partitioned into classes (…
A New Characterization of Path Graphs
Nicola Apollonio, Lorenzo Balzotti
Path graphs are intersection graphs of paths in a tree.~In this paper we give a "6\ good characterization" of path graphs, namely, we prove that path graph membership is in $NP\cap…
A tight relation between series-parallel graphs and Bipartite Distance Hereditary graphs
Nicola Apollonio, Massimiliano Caramia, Paolo Giulio Franciosa +1
Bandelt and Mulder's structural characterization of Bipartite Distance Hereditary graphs asserts that such graphs can be built inductively starting from a single vertex and by repe…
On Computing the Galois Lattice of Bipartite Distance Hereditary Graphs
Nicola Apollonio, Paolo Giulio Franciosa
The class of Bipartite Distance Hereditary (BDH) graphs is the intersection between bipartite domino-free and chordal bipartite graphs.\ Graphs in both the latter classes have line…
Minimally unbalanced diamond-free graphs and Dyck-paths
N. Apollonio, A. Galluccio
A -matrix is balanced if it does not contain a submatrix of odd order having exactly two 1's per row and per column. A graph is balanced if its clique-matrix…
On the Galois Lattice of Bipartite Distance Hereditary Graphs
Nicola Apollonio, Massimiliano Caramia, Paolo Giulio Franciosa
We give a complete characterization of bipartite graphs having tree-like Galois lattices. We prove that the poset obtained by deleting bottom and top elements from the Galois latti…