A graph and its complement
The product of the total restrained domination numbers of a graph and its complement
... The aim of this paper is to bound the product of the total restrained domination numbers of a graph and its complement. We show that if n ≥ 4, and neither G nor G contains isolated vertices or is ...
12
On the rank of the Doob graph and its complement
... 1 Department of Mathematics, American University of the Middle East, Kuwait. *Corresponding author: [email protected] Abstract We compute the rank of the circulant Doob graph defined in Doob (2002). We ...
5
Connectivity in a Bipolar Fuzzy Graph and its Complement
... Abstract. Connectivity has important role in the area of applications of fuzzy graphs such as fuzzy neural networks and clustering. In this paper criterion for connectivity of a bipolar fuzzy graph and its ...
7
On the Hosoya Polynomial and Wiener Index of Semitotal Point Graph and its Complement
... a graph G is the sum of distances between all (unordered) pairs of vertices of ...point graph and its complement of certain graph ...
8
On the Line Graph of the Complement Graph for the Ring of Gaussian Integers Modulo n
... The line graph for the complement of the zero divisor graph for the ring of Gaussian integers modulo n is studied. The diameter, the radius and degree of each vertex are determined. Complete ...
11
Detour Energy of Complement of Subgroup Graph of Dihedral Group
... Key Word: Detour energy, complement of subgroup graph, dihedral group, normal subgroup Abstrak Penelitian terkait energi suatu graf menjadi topik yang banyak diminati. Salah satunya adalah energi detour ...
8
Vertex Coloring of A Complement Fuzzy Graph R. Vinitha 1, H. Haseena Begum2
... undirected graph where V is a set of vertices and each vertices has a membership value ...that graph is the minimum number of color needed to color the ...of complement of a fuzzy ...
5
Neighborhood total domination of a graph and its complement
... d n 2 e + 3 if diam(G) = 2. , where G is the complement of G. The problem of characterizing graphs attaining equality in the previous bounds was left as an open problem by the authors. In this paper, we address ...
8
A graph and its complement with specified properties III: girth and circumference
... concentrate on the two invariants concerning cycle lengths- girth and circum-.. ference.. one in G and the other in G which have exactly one common point..[r] ...
8
Objectivity positions graph database as relational complement to InfiniteGraph 3.0
... Objectivity Inc has launched version 3.0 of its InfiniteGraph graph database, improving distributed parallel navigation and adding a user-defined algorithm library. Perhaps the most significant change with ...
5
Degree distance index of the Mycielskian and its complement
... A BSTRACT Let G be a finite connected simple graph. The degree distance index DD (G ) of G is defined as { u , v } V ( G ) d G ( u , v )(deg G ( u ) deg G ( v )) , where deg G ( u ) is the degree of vertex u ...
9
On a graph parameter related to vertex labelings and its application to minimum rank problems in graph theory
... a graph is equal to one more than the maximum degree of its complement, the δ -conjecture can also be stated as follows: Conjecture ...a graph, then mr(G) ≤ ∆(Gc) + ...the complement of ...
57
Efficient clique decomposition of a graph into its atom graph
... the same atom graph. Let C = A \ S, let G 0 = G(V \ C) and let H 0 = H(V \ C). T 0 is an atom tree of G 0 , S is also a clique minimal separator of H and C is also a full component of S in H. By Lemma 4.3 G 0 and ...
16
Some Graph Polynomials of the Power Graph and its Supergraphs
... simple graph with edge set E(Γ), and vertex set V ...a graph such that no two of them are adjacent, is called an independent ...the graph Γ, a set S of vertices is a clique, if every two distinct ...
10
Nondemolition measurement of the vacuum state or its complement
... vacuum, in contrast to previous proposals for quantum nondemolition measurements of the optical field [6,7]. We can extend the method to project onto the joint n-mode vacuum state or complement, as required in the ...
5
COMPLEMENT AND ITS COMPONENTS IN HUMAN CEREBROSPINAL FLUID
... The tests for components indicated that all were present in varying amounts in human CSF with- out any obvious correlation between the strength of the test for a component and total prot[r] ...
5
Graph Theory and Its Applications
... weighted graph, what is the shortest path between two given vertices? In computer network for example, what are the set of telephone lines that for connecting Karachi and London gives the least cost or the fastest ...
28
quadratic function and its graph
... Higher degree polynomial functions When a polynomial function has a degree that is higher than 4, we proceed in the same way as before. That is, first write the polynomial expression in factorised form. For each factor ...
48
On a graph isomorphic to its intersection graph: self-graphoidal graphs
... A graph G is called a graphoidal graph if there exists a graph H and a graphoidal cover ψ of H such that G ∼ = Ω(H, ...the graph G is said to be self-graphoidal if it is isomorphic to one of ...
9
Metabolism of the fifth component of complement, and its relation to metabolism of the third component, in patients with complement activation
... subjects and patients by simultaneous administration of radioiodine labeled C5 and C3. In seven normal subjects the fractional catabolic rate of C5 ranged from 1.5 to 2.1% of the plasma pool/h and ...
13