Abstract
The triad counts of a graph G are the numbers of various distinct induced subgraphs of order 3. If G is an undirected graph, there are 4 triad counts, and if G is a digraph, there are 16 triad counts. A multigraph is a sequence G = (G1,..., Gr) of graphs and digraphs defined on a common vertex set. The concept of triad counts is generalized to multigraphs with colored vertices, edges, and arcs. It is shown how triad counts in multigraphs can be used in various kinds of statistical analyses of graph data. In particular, probability distributions are investigated of the triad counts in random multigraphs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
