Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Asymptotic enumeration of labeled multigraphs by vertices, edges, and degree parities
View through CrossRef
AbstractWe show that the number of labeled (n, q)‐multigraphs with some specified p vertices of odd degree is asymptotically independent of p and is in fact asymptotically 21−n times the number of (n, q)‐multigraphs. We determine the asymptotic number of (n, q)‐multigraphs.
Title: Asymptotic enumeration of labeled multigraphs by vertices, edges, and degree parities
Description:
AbstractWe show that the number of labeled (n, q)‐multigraphs with some specified p vertices of odd degree is asymptotically independent of p and is in fact asymptotically 21−n times the number of (n, q)‐multigraphs.
We determine the asymptotic number of (n, q)‐multigraphs.
Related Results
Domination of Polynomial with Application
Domination of Polynomial with Application
In this paper, .We .initiate the study of domination. polynomial , consider G=(V,E) be a simple, finite, and directed graph without. isolated. vertex .We present a study of the Ira...
Product of digraphs, (super) edge-magic valences and related problems
Product of digraphs, (super) edge-magic valences and related problems
Discrete Mathematics, and in particular Graph Theory, has gained a lot of popularity during the last 7 decades. Among the many branches in Graph Theory, graph labelings has experim...
Gallai's Path Decomposition for 2-degenerate Graphs
Gallai's Path Decomposition for 2-degenerate Graphs
Gallai's path decomposition conjecture states that if $G$ is a connected
graph on $n$ vertices, then the edges of $G$ can be decomposed into at most
$\lceil \frac{n }{2} \rceil$ pa...
The terminations of corticospinal tract axons in the macaque monkey
The terminations of corticospinal tract axons in the macaque monkey
AbstractThis study examined the corticospinal tract in monkey by utilizing the anterograde transport of wheat germ lectin conjugated to horseradish peroxidase (WGA HRP) at the ligh...
Xor-Magic Graphs
Xor-Magic Graphs
Abstract
A connected graph on 2n vertices is defined to be xor-magic if the vertices can be labeled with distinct n-bit binary numbers in such a way that the label a...
The edge surviving rate of Halin graphs
The edge surviving rate of Halin graphs
<p>Let <span class="math inline">\(k\ge 1\)</span> be an integer. Let <span class="math inline">\(G=(V,E)\)</span> be a connected graph with <span ...
2-Edge Connectivity in Directed Graphs
2-Edge Connectivity in Directed Graphs
Edge and vertex connectivity are fundamental concepts in graph theory. While they have been thoroughly studied in the case of undirected graphs, surprisingly, not much has been inv...
Connectivity Index of Directed Rough Fuzzy Graphs
and its Application in Traffic Flow Network
Connectivity Index of Directed Rough Fuzzy Graphs
and its Application in Traffic Flow Network
Abstract
The directed rough fuzzy graph (DRFG) is a fusion of rough and fuzzy theory, because it
deals with incomplete and vague information simultaneously. Connection or t...