• No results found

[PDF] Top 20 A Partial Order on Bipartite Graphs with n Vertices

Has 10000 "A Partial Order on Bipartite Graphs with n Vertices" found on our website. Below are the top 20 most common "A Partial Order on Bipartite Graphs with n Vertices".

A Partial Order on Bipartite Graphs with n Vertices

A Partial Order on Bipartite Graphs with n Vertices

... the bipartite graph with n vertices, 1,2,…,n, having the basis {1,2,…,m}; and the set of edges being the union of the set of edges of U and the set of those edges of V which have an endpoint ... See full document

10

Bipartite Kneser graphs are Hamiltonian

Bipartite Kneser graphs are Hamiltonian

... and n ≥ 2k +1 the Kneser graph K(n, k) has as vertices all k-element subsets of [n] := { 1, 2, ..., n } and an edge between any two vertices (=sets) that are ...The ... See full document

10

On the Laplacian spectral radii of Halin graphs

On the Laplacian spectral radii of Halin graphs

... four vertices, none of which has degree 2, embedded in the ...Halin graphs with μ (G) ≥ n – 4. Moreover, we obtain the graphs with the first three largest Laplacian spectral radius among all ... See full document

18

On the least signless Laplacian eigenvalue of a non bipartite connected graph with fixed maximum degree

On the least signless Laplacian eigenvalue of a non bipartite connected graph with fixed maximum degree

... unicyclic graphs of order n with maximum degree and among all non-bipartite connected graphs of order n with maximum degree , ... See full document

10

Computation of a Tree 3-Spanner on Trapezoid Graphs

Computation of a Tree 3-Spanner on Trapezoid Graphs

... ( n + m ) time sequential algorithm to find tree 3-spanner on interval graphs, permutation graphs and regular bipartite graphs, where m and n represent, respectively, the number ... See full document

16

Automorphism Groups Of Weakly Semi-Regular Bipartite  Graphs

Automorphism Groups Of Weakly Semi-Regular Bipartite Graphs

... The order of G is the number of its vertices and size of G is the number of its ...simple graphs are isomorphic, there is a one-to-one correspondence between the vertices of the two ... See full document

5

A Note on Global Bipartite Domination in  Graphs

A Note on Global Bipartite Domination in Graphs

... connected bipartite graph with bipartition ( X, Y ) , with | X | = m and | Y | = ...global bipartite dominating set (GBDS) of G is a set S of vertices of G such that it dominates G and its relative ... See full document

5

On the extremal hyper wiener index of graphs

On the extremal hyper wiener index of graphs

... the order of the Wiener indices among all the trees with given order and diameter, ...with n vertices and n+2 ... n 3 which have at most a common vertex between any two ... See full document

5

Zero sum partition theorems for graphs

Zero sum partition theorems for graphs

... A partial sample of the problems evolved from Gallai’s theorem is: PROBLEM 1: What is the maximum order of an induced subgraph // of a graph G, with n non-isolated vertices, such that in[r] ... See full document

6

Zarankiewicz Numbers and Bipartite Ramsey Numbers

Zarankiewicz Numbers and Bipartite Ramsey Numbers

... a bipartite graph, with the bipartition of its vertices V (G) = L(G) ∪ R(G), or simply V = L ∪ R, we will denote it by writing G[L, ...and n of the left and right parts of the vertex set V (G), m = ... See full document

16

Szeged index of bipartite unicyclic graphs

Szeged index of bipartite unicyclic graphs

... of vertices of a graph G is denoted by | G | . Let P n and C n be respectively the n -vertex path and ...is bipartite if and only if its unique cycle length is even. Let C n T T ... See full document

12

The Signless Laplacian Spectral Radius of Some Special Bipartite Graphs

The Signless Laplacian Spectral Radius of Some Special Bipartite Graphs

... fixed order of n and the size of n k k + ( > 0 ) , and describes the structure of the bipartite graph with maximum adjacency spectrum ...the bipartite graph of the fixed order ... See full document

7

Ordering non bipartite unicyclic graphs with pendant vertices by the least Q eigenvalue

Ordering non bipartite unicyclic graphs with pendant vertices by the least Q eigenvalue

... with n vertices and n + c –  ...unicyclic graphs of order n with k pendant ...unicyclic graphs of order n with k pendant vertices ordering by least ... See full document

11

Bipartite Toughness and k Factors in Bipartite Graphs

Bipartite Toughness and k Factors in Bipartite Graphs

... A bipartite graph can have a regular degree factor only if |X| ...balanced bipartite graph with |X | |Y | ...of vertices adjacent to at least one vertex in ... See full document

8

Graphs without proper subgraphs of minimum degree 3 and short cycles

Graphs without proper subgraphs of minimum degree 3 and short cycles

... The structure of this paper is as follows. In Section 2 we construct our counterexamples to Conjecture 1.1 via proving part (ii) of Theorem 1.3 and Theorem 1.2. In Section 3 we study necessary leaf-leaf path lengths in ... See full document

23

Algorithmic aspects of bipartite graphs

Algorithmic aspects of bipartite graphs

... so If we take as in Rose and Tarjan [2] an ordering of pivots down the main diagonal F fill-in the then 4 [z,yx,x2,y,...,xs,y], where z,,y corresponds to the entry rn,, of produced by th[r] ... See full document

6

Beyond Ohba’s conjecture : a bound on the choice number of k chromatic graphs with n vertices

Beyond Ohba’s conjecture : a bound on the choice number of k chromatic graphs with n vertices

... Lemma 3.3. When the merges satisfy (P1)-(P8), the family of all resulting lists has an SDR. Proof. By Hall’s Theorem, it suffices to prove | L(S) | ≥ | S | for each vertex set S (after the merges). We use (P1)–(P7) to ... See full document

15

Locally Checkable Proofs in Distributed Computing

Locally Checkable Proofs in Distributed Computing

... Proof sketch. The negative results build on the same basic idea. We will consider graph properties on cycles. We will assume that there is a proof labeling scheme ( f , A ) with o(log n)-bit proofs. We will take ... See full document

33

Monochromatic triangles in three coloured graphs

Monochromatic triangles in three coloured graphs

... complete graphs whose edge sets are coloured with more than two ...for n sufficiently large, we determine the minimum number of monochromatic triangles in a 3-coloured copy of K n ...K n that ... See full document

16

An Analysis of a Recursive and an Iterative Algorithm for Generating Permutations Modified for Travelling Salesman Problem

An Analysis of a Recursive and an Iterative Algorithm for Generating Permutations Modified for Travelling Salesman Problem

... of n numbers, where n equals to the number of vertices in a given ...the order of the numbers in the current ...the order of 2 3 to 2 4 times) than the iterative ... See full document

8

Show all 10000 documents...