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

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

Let n 1 be an integer. The hypercube Qn is the graph whose vertex set isf0;1gn, where two n-tuples are adjacent if they differ in precisely one coordinate. This graph has many applications in Computer sciences and other area of sciences. Inthe graph Qn, the layer Lk is the set of vertices with exactly k 1’s, namely, vertices ofweight k, 1 k n. The hyper-star graph B(n;k) is...

Expressions for the Zagreb indices and coindices of the total graph, semi-total point graph and of semi-total line graph of subdivision graphs in terms of the parameters of the parent graph are obtained, thus generalizing earlier existing results.

Journal: :Rhode Island medical journal 2017
Dieter Pohl Aaron Bloomenthal

For many physicians, the concept of surgery as the best treatment for a medical disease such as diabetes, cardiovascular problems, hyperlipidemia, sleep apnea, hepatosteatosis, GERD, osteoarthritis, psoriasis, rheumatoid arthritis, or infertility, still sounds wrong and just a ploy by surgeons to increase their business. Since 2011, however, several non-surgical societies have recommended Weigh...

2010
B. A. Peavy

Presented a re methods that avoid the need to em ploy an extrapolation technique in the region of the criti ca l points for evaluation of the apparent e mmissivity of diffuse cylindrical and conical cavities. The methods involve appropriate s ubstitutions in the integrands of integral equations that are used in a nalytical so lut ions for determ ining the therm al radiation characteri sti cs of...

2008
Michael J. Freedman Christina Aperjis Ramesh Johari

We present a novel design for a peer-assisted content distribution system that addresses two key shortcomings of existing proposals. First, our system explicitly identifies the relative demand for files: users are rewarded for sharing more popular content. Second, our system efficiently utilizes network resources, by considering resource constraints explicitly when matching downloaders and uplo...

Journal: :Haematology and blood transfusion 1983
P E Thorpe S I Detre D W Mason A J Cumber W C Ross

The advent of cell fusion techniques for producing monoclonal antibodies has stimulated world-wide effort in the search for antibodies with specificity for neoplastic cells. In parallel, a number of laboratories have attempted to devise ways of attaching cytotoxic agents to antibodies with the aim of generating potent anticancer agents from monoclonal antibodies that exhibit sufficient specific...

The concept of super line graph was introduced in the year 1995 by Bagga, Beineke and Varma. Given a graph with at least r edges, the super line graph of index r, Lr(G), has as its vertices the sets of r-edges of G, with two adjacent if there is an edge in one set adjacent to an edge in the other set. The line completion number lc(G) of a graph G is the least positive integer r for which Lr(G) ...

Journal: :bulletin of the iranian mathematical society 0
m. r. fander ‎‎science and research branch‎, ‎islamic azad university‎ ‎(iau)‎, ‎tehran‎, ‎iran.

it is shown that when a special vertex stretching is applied to a graph, the cochordal cover number of the graph increases exactly by one, as it happens to its induced matching number and (castelnuovo-mumford) regularity. as a consequence, it is shown that the induced matching number and cochordal cover number of a special vertex stretching of a graph g are equal provided g is well-covered bipa...

Journal: :international journal of group theory 2016
majid arezoomand bijan taeri

‎let $s$ be a subset of a finite group $g$‎. ‎the bi-cayley graph ${rm bcay}(g,s)$ of $g$ with respect to $s$ is an undirected graph with vertex set $gtimes{1,2}$ and edge set ${{(x,1),(sx,2)}mid xin g‎, ‎ sin s}$‎. ‎a bi-cayley graph ${rm bcay}(g,s)$ is called a bci-graph if for any bi-cayley graph ${rm bcay}(g,t)$‎, ‎whenever ${rm bcay}(g,s)cong {rm bcay}(g,t)$ we have $t=gs^alpha$ for some $...

Journal: :international journal of group theory 2015
seyed ali moosavi

the concept of the bipartite divisor graph for integer subsets has been considered in [‎graph combinator., ‎ 26 (2010) 95--105‎.]. ‎in this paper‎, ‎we will consider this graph for the set of character degrees of a finite group $g$ and obtain some properties of this graph‎. ‎we show that if $g$ is a solvable group‎, ‎then the number of connected components of this graph is at most $2$ and if $g...

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

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