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

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

2003
Yuri Boykov Vladimir Kolmogorov

Geodesic active contours and graph cuts are two standard image segmentation techniques. We introduce a new segmentation method combining some of their benefits. Our main intuition is that any cut on a graph embedded in some continuous space can be interpreted as a contour (in 2D) or a surface (in 3D). We show how to build a grid graph and set its edge weights so that the cost of cuts is arbitra...

1999
DONAL O’REGAN

A nonlinear alternative of Leray–Schauder type is presented for condensing operators with closed graph. We will then use this theorem to establish new existence principles for differential and integral inclusions in Banach spaces.

Journal: :Ars Comb. 2004
Raphael Yuster

Let G be a graph with integral edge weights. A function d : V (G) → Zp is called a nowhere 0 mod p domination function if each v ∈ V satisfies ( d(v) + ∑ u∈N(v) w(u, v)d(u) ) 6= 0 mod p, where w(u, v) denotes the weight of the edge (u, v) and N(v) is the neighborhood of v. The subset of vertices with d(v) 6= 0 is called a nowhere 0 mod p dominating set. It is known that every graph has a nowher...

Journal: :journal of algebra and related topics 2015
a. sharma a. gaur

let $r$ be a commutative ring with identity. let $g(r)$ denote the maximal graph associated to $r$, i.e., $g(r)$ is a graph with vertices as the elements of $r$, where two distinct vertices $a$ and $b$ are adjacent if and only if there is a maximal ideal of $r$ containing both. let $gamma(r)$ denote the restriction of $g(r)$ to non-unit elements of $r$. in this paper we study the various graphi...

Journal: :Discrete Mathematics 1998
M. R. Sridharan K. Balaji

In this note we prove that a self-complementary graph with p vertices is chordal if and only if its clique number is integral part of (p + 1)/2. (~) 1998 Elsevier Science B.V. All rights reserved

Journal: :Discrete Mathematics 2008
Ligong Wang Xiaodong Liu

A graph is called integral if all eigenvalues of its adjacency matrix are integers. In this paper, we investigate integral complete r-partite graphsKp1,p2,...,pr =Ka1·p1,a2·p2,...,as ·ps with s=3, 4.We can construct infinite many new classes of such integral graphs by solving some certain Diophantine equations. These results are different from those in the existing literature. For s = 4, we giv...

2000
Wolfram Kahl

Wepresent a typing concept for second-order term graphsthat doesnot consider the types as an external add-on, but as an integral part of the term graph structure. This allows a homogeneous treatment of term-graph representationsof many kinds of typing systems, including second-order λ-calculi and systems of dependent types. Applications can be found in interactive systems and as typed intermedi...

2010
Jared Nishikawa Peter T. Otto Colin Starr

In this paper, we investigate the polynomial integrand of an integral formula that yields the expected length of the minimal spanning tree of a graph whose edges are uniformly distributed over the interval [0, 1]. In particular, we derive a general formula for the coefficients of the polynomial and use it to express the first few coefficients in terms of the structure of the underlying graph; e...

1998
Wolfram Kahl

Wepresent a typing concept for second-order term graphsthat doesnot consider the types as an external add-on, but as an integral part of the term graph structure. This allows a homogeneous treatment of term-graph representationsof many kinds of typing systems, including second-order λ-calculi and systems of dependent types. Applications can be found in interactive systems and as typed intermedi...

Journal: :CoRR 2016
S. Akbari P. Csíkvári A. Ghafari S. Khalashi Ghezelahmad M. Nahvi

In this paper, we study graphs with integer matching polynomial roots. We characterize all traceable graphs whose all matching polynomial roots are integer. We show that there is no k-regular claw-free graph (k ≥ 2), whose all matching polynomial roots are integer. Also we conjecture that apart from K7 \ (E(C3) ∪E(C4)), there is no matching integral k-regular graph (k ≥ 2). 2010 Mathematics Sub...

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

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