نتایج جستجو برای: vertex co
تعداد نتایج: 372055 فیلتر نتایج به سال:
In this paper we consider module-composed graphs, i.e. graphs which can be defined by a sequence of single vertex insertions v1, . . . , vn, such that the neighbourhood of vertex vi, 2 ≤ i ≤ n, forms a module (a homogenous set) of the graph defined by vertices v1, . . . , vi−1. Module composed graphs are HHDS-free and thus homogeneous orderable, weakly chordal, and perfect. Every bipartite dist...
We analyze directed, unweighted graphs obtained from xi ∈ R by connecting vertex i to j iff |xi − xj | < ε(xi). Examples of such graphs include k-nearest neighbor graphs, where ε(xi) varies from point to point, and, arguably, many real-world graphs such as copurchasing graphs. We ask whether we can recover the underlying Euclidean metric ε(xi) and the associated density p(xi) given only the dir...
This paper studies certain relations among vertex algebras, vertex Lie algebras and vertex poisson algebras. In this paper, the notions of vertex Lie algebra (conformal algebra) and vertex poisson algebra are revisited and certain general construction theorems of vertex poisson algebras are given. A notion of filtered vertex algebra is formulated in terms of a notion of good filtration and it i...
A weighted graph G is called well-covered if all its maximal independent sets have the same weight. Let S be an independent set of G (possibly, S = ∅). The subgraph G − N [S] is called a co-stable subgraph of G. We denote by CSub(G) the set of all co-stable subgraphs of G considered up to isomorphism. A class of weighted graphs P is called co-hereditary if it is closed under taking co-stable su...
Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$, and let $d_u$ denote the degree of vertex $u$ in $G$. The Randi'c index of $G$ is defined as${R}(G) =sum_{uvin E(G)} 1/sqrt{d_ud_v}.$In this paper, we investigate the relationships between Randi'cindex and several topological indices.
For a graph invariant π, the Contraction(π) problem consists of, given G and positive integers k,d, deciding whether one can contract k edges of to obtain in which π has dropped by at least d. Galby et al. [ISAAC 2019, MFCS 2019] studied case where is size minimum dominating set. We focus on invariants defined as vertex set that hits all occurrences graphs collection H according fixed containme...
Vertex Pharmaceuticals, Boston, Massachusetts (NH); Genentech, South San Francisco, California (JRK); Novartis Pharmaceuticals, Florham Park, New Jersey (HE); Eli Lilly and Company, Indianapolis, Indiana (MM); Boehringer Ingelheim, Ridgefield, Connecticut (DR); Merck and Co., Kenilworth, New Jersey (JP), Amgen Inc., Thousand Oaks, California (JD), Pfizer Global Research and Development, Groton,...
In 1960 Paul Erdos and Alfred Renyi [ER] began the subject of random graphs. The 1985 book of Bela Bollobas [B) provides the standard reference for this field. In modern terminology the random graph G(n, p) is a graph on vertex set [n] = {I, ... , n} where each pair i, j of vertices are adjacent with independent probability p. More accurately, G(n, p) is a probability space over the space of gr...
in this paper, it was shown that , where and , and , where is not prime and , are od-characterizable.
let $gamma_{n,kappa}$ be the class of all graphs with $ngeq3$ vertices and $kappageq2$ vertex connectivity. denote by $upsilon_{n,beta}$ the family of all connected graphs with $ngeq4$ vertices and matching number $beta$ where $2leqbetaleqlfloorfrac{n}{2}rfloor$. in the classes of graphs $gamma_{n,kappa}$ and $upsilon_{n,beta}$, the elements having maximum augmented zagreb index are determined.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید