نتایج جستجو برای: simple graph

تعداد نتایج: 634615  

Journal: :Proceedings of the ... AAAI Conference on Artificial Intelligence 2023

Heterogeneous graph neural networks (HGNNs) have the powerful capability to embed rich structural and semantic information of a heterogeneous into node representations. Existing HGNNs inherit many mechanisms from (GNNs) designed for homogeneous graphs, especially attention mechanism multi-layer structure. These bring excessive complexity, but seldom work studies whether they are really effectiv...

Journal: :Journal of Combinatorial Theory, Series B 2004

Journal: :Notre Dame Journal of Formal Logic 2010
Johanna N. Y. Franklin

The weakly random reals contain not only the Schnorr random reals as a subclass but also the weakly 1-generic reals and therefore the n-generic reals for every n. While the class of Schnorr random reals does not overlap with any of these classes of generic reals, their degrees may. In this paper, we describe the extent to which this is possible for the Turing, weak truth-table, and truth-table ...

Journal: :Journal of Approximation Theory 2007
W. Odyniec M. P. Prophet

In this paper we give a lower bound for the strongly unique minimal projection (with norm one) constant (SUP-constant) onto some (n − k)-dimensional subspaces of l ∞ (n ≥ 3, 1 ≤ k ≤ n−1). By Proposition 1 of this paper, each k-dimensional Banach space with polytope unit ball with m (k − 1)-faces is isometrically isomorphic to a subspace of lk+m−1 ∞ . As such the aforementioned estimation can be...

Journal: :transactions on combinatorics 2014
ran gu fei huang xueliang li

let $g$ be a simple graph with vertex set $v(g) = {v_1, v_2,ldots, v_n}$ and edge set $e(g) = {e_1, e_2,ldots , e_m}$. similar tothe randi'c matrix, here we introduce the randi'c incidence matrixof a graph $g$, denoted by $i_r(g)$, which is defined as the$ntimes m$ matrix whose $(i, j)$-entry is $(d_i)^{-frac{1}{2}}$ if$v_i$ is incident to $e_j$ and $0$ otherwise. naturally, therandi'c incidenc...

Journal: :transactions on combinatorics 2012
saeid alikhani mohammad hossein reyhani

let $g$ be a simple graph of order $n$‎. ‎we consider the‎ ‎independence polynomial and the domination polynomial of a graph‎ ‎$g$‎. ‎the value of a graph polynomial at a specific point can give‎ ‎sometimes a very surprising information about the structure of the‎ ‎graph‎. ‎in this paper we investigate independence and domination‎ ‎polynomial at $-1$ and $1$‎.

Journal: :iranian journal of mathematical chemistry 2012
s. alikhani m. a. iranmanesh

let g be a simple graph and (g,) denotes the number of proper vertex colourings of gwith at most  colours, which is for a fixed graph g , a polynomial in  , which is called thechromatic polynomial of g . using the chromatic polynomial of some specific graphs, weobtain the chromatic polynomials of some nanostars.

Journal: :bulletin of the iranian mathematical society 2012
x. zhang g. liu j. l. wu

a proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. a graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $g$ such that each vertex receives a color from its own list. in this paper, we prov...

باقری, علیرضا, سپهری, اکرم,

In this paper we consider to embed a tree T with N vertices on a set of N points inside a simple polygon on n vertices and the goal is to minimize the number of bends. The main idea of our algorithm is modeling the problem into graph matching problem and uses the graph matching algorithms. We apply the concept of error-correction transformation and find the appropriate cost function then we per...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید