Results 61 to 70 of about 805,669 (72)
Hypergraphs with infinitely many extremal constructions
Discrete Analysis, 2023 Hypergraphs with infinitely many extremal constructions, Discrete Analysis 2023:18, 34 pp. A fundamental result in extremal graph theory, Turán's theorem, states that the maximal number of edges of a graph with $n$ vertices that does not contain a ...
Jianfeng Hou +4 more
doaj +1 more source
Study of Random Walk Invariants for Spiro-Ring Network Based on Laplacian Matrices
MathematicsThe use of the global mean first-passage time (GMFPT) in random walks on networks has been widely explored in the field of statistical physics, both in theory and practical applications. The GMFPT is the estimated interval of time needed to reach a state
Yasir Ahmad +3 more
doaj +1 more source
Adaptive Inferential Method for Monotone Graph Invariants [PDF]
arXiv, 2017 We consider the problem of undirected graphical model inference. In many applications, instead of perfectly recovering the unknown graph structure, a more realistic goal is to infer some graph invariants (e.g., the maximum degree, the number of connected subgraphs, the number of isolated nodes). In this paper, we propose a new inferential framework for
arxiv
Interval Graphs are Reconstructible [PDF]
arXivA graph is reconstructible if it is determined up to isomorphism by the multiset of its proper induced subgraphs. The reconstruction conjecture postulates that every graph of order at least 3 is reconstructible. We show that interval graphs with at least three vertices are reconstructible.
arxiv
What is actually a metric graph? [PDF]
arXiv, 2019 Metric graphs are often introduced based on combinatorics, upon "associating" each edge of a graph with an interval; or else, casually "gluing" a collection of intervals at their endpoints in a network-like fashion. Here we propose an abstract, self-contained definition of metric graph.
arxiv
The Simultaneous Interval Number: A New Width Parameter that Measures the Similarity to Interval Graphs [PDF]
arXivWe propose a novel way of generalizing the class of interval graphs, via a graph width parameter called the simultaneous interval number. This parameter is related to the simultaneous representation problem for interval graphs and defined as the smallest number $d$ of labels such that the graph admits a $d$-simultaneous interval representation, that is,
arxiv
The poset of graphs ordered by induced containment [PDF]
arXiv, 2018 We study the poset $\mathcal{G}$ of all unlabelled graphs, up to isomorphism, with $H\le G$ if $H$ occurs as an induced subgraph in $G$. We present some general results on the M\"obius function of intervals of $\mathcal{G}$ and some results for specific classes of graphs. This includes a case where the M\"obius function is given by the Catalan numbers,
arxiv
Bipartite powers of some classes of bipartite graphs [PDF]
arXivGraph powers are a well-studied concept in graph theory. Analogous to graph powers, Chandran et al.[3] introduced the concept of bipartite powers for bipartite graphs. In this paper, we will demonstrate that some well-known classes of bipartite graphs, namely the interval bigraphs, proper interval bigraphs, and bigraphs of Ferrers dimension 2, are ...
arxiv
Безопасность информационных технологийThe purpose of the article is to develop a methodology for conducting a computational experiment to assess the security of software in the dynamics of its operation in internal affairs bodies (ATS) automated systems (AS). The technique allows to identify
Arina D. Popova +2 more
doaj +1 more source
Assessment and Comparison of Landscape Connectivity in KoozehTopraghi Watershed, Ardabil Province
Iranian Journal of Applied Ecology, 2020 Following the unbalanced development and overexploitation of the countrychr('39')s watersheds, land fragmentation has become a major concern for the conservation of ecosystem services and land health.
N. Alaei +4 more
doaj