• 沒有找到結果。

[PDF] Top 20 On The Domatic Number of Bipartite Permutation Graphs

Has 10000 "On The Domatic Number of Bipartite Permutation Graphs" found on our website. Below are the top 20 most common "On The Domatic Number of Bipartite Permutation Graphs".

On The Domatic Number of Bipartite Permutation Graphs

On The Domatic Number of Bipartite Permutation Graphs

... On The Domatic Number of Bipartite Permutation Graphs Kai Wen Tsui 1 and William Chung-Kung Yen 2 and Chuan Yi Tang 3 1 Department of Computer Science, ... See full document

5

THE DOMATIC NUMBER PROBLEM IN INTERVAL-GRAPHS

THE DOMATIC NUMBER PROBLEM IN INTERVAL-GRAPHS

... Received by the editors June 30, 1989; accepted for publication (in revised form) March 6, 1990. Redistribution subject to SIAM license or copyright; see http://www.siam.org/journals/ojs[r] ... See full document

6

THE DOMATIC NUMBER PROBLEM

THE DOMATIC NUMBER PROBLEM

... The purpose of this paper is to study the domatic numbers of graphs that are obtained from small graphs by performing graph operations, such as union, join and[r] ... See full document

8

On the largest eigenvalues of bipartite graphs which are nearly complete

On the largest eigenvalues of bipartite graphs which are nearly complete

... a bipartite graph, and A be its adjacency matrix . Then the eigenvalues of A are symmetric about the origin, i ...eigenvalue of A 2 if and only if ±√μ are eigenvalues of A ... See full document

9

The decycling number of outerplanar graphs

The decycling number of outerplanar graphs

... In the literature, a set of vertices of a graph whose removal leaves an acyclic graph is referred to as a decycling set (Beineke and Vandell 1997), or a feedback vertex set (Wang et ...1985), ... See full document

7

Object-based multimedia scheduling based on bipartite graphs

Object-based multimedia scheduling based on bipartite graphs

... optimization, bipartite matching 1. Introduction The scheduling problem with QoS requirements is an im- portant issue for multimedia delivery across bandwidth con- strained and limited ...a number ... See full document

12

Group testing in bipartite graphs

Group testing in bipartite graphs

... IN BIPARTITE GRAPHS ¤ Su-Tzu Juan and Gerard ...investigates the group testing problem in graphs as ...determine the minimum number t(G) such that t(G) tests are sufficient to ... See full document

7

Spider web networks: a family of optimal, fault tolerant, hamiltoman bipartite graphs

Spider web networks: a family of optimal, fault tolerant, hamiltoman bipartite graphs

... determines the performance of the ...in the literature for the purpose of connecting a large number of processing ...where the nodes represent processors and ... See full document

14

The super connectivity of the pancake graphs and the super laceability of the star graphs

The super connectivity of the pancake graphs and the super laceability of the star graphs

... a bipartite graph with one partite set containing all odd permutations and the other partite set containing all even ...even permutation as a white vertex, and refer an odd permutation as a ... See full document

15

Chia-an
Liu, Chih-wen Weng, Spectral characterizations of two families
of nearly complete bipartite graphs, Annals of Mathematical Sciences
and Applications, Volume 2, Number 2(2017), 241-254

Chia-an Liu, Chih-wen Weng, Spectral characterizations of two families of nearly complete bipartite graphs, Annals of Mathematical Sciences and Applications, Volume 2, Number 2(2017), 241-254

... characterizations of two families of nearly complete bipartite graphs Chia-an Liu and Chih-wen Weng It is not hard to find many complete bipartite graphs which are not determined ... See full document

14

On the Extremal Number of Edges in Hamiltonian Graphs

On the Extremal Number of Edges in Hamiltonian Graphs

... denote the number of combinations of “a” numbers taking “b” numbers at a time, where a, b are positive integers and a ≥ ...For the graph definitions and notations, we follow ...subset ... See full document

7

Characterizations of bipartite Steinhaus graphs

Characterizations of bipartite Steinhaus graphs

... In this section we give a simple characterization of the diagonal generators and adjacency lists, an alternative description of the row generators, and lists of [r] ... See full document

15

A theorem on permutation graphs with applications

A theorem on permutation graphs with applications

... By the aid of this theorem, sequential and parallel algorithms to determine if a given permutation graph is a cograph can be derived.. The rest of this paper i[r] ... See full document

15

On the extremal number of edges in hamiltonian connected graphs

On the extremal number of edges in hamiltonian connected graphs

... On the extremal number of edges in hamiltonian connected graphs I Tung-Yang Ho a, ∗ , Cheng-Kuan Lin b , Jimmy ...Department of Information Management, Ta Hwa Institute of ... See full document

4

FINDING A COMPLETE MATCHING WITH THE MAXIMUM PRODUCT ON WEIGHTED BIPARTITE GRAPHS

FINDING A COMPLETE MATCHING WITH THE MAXIMUM PRODUCT ON WEIGHTED BIPARTITE GRAPHS

... Each application of Step 3 in Algorithm 2.1 will produce at least one more one in the uncrossed entries in the matrix and leave all the ones unchanged, unless they are crossed by [r] ... See full document

7

Channel graphs of bit permutation networks

Channel graphs of bit permutation networks

... Channel graphs have been widely used in the study of blocking ...bit permutation network has a unique channel graph if and only if it is connected, and two connected bit permutation ... See full document

5

EDGE DOMATIC NUMBERS OF COMPLETE N-PARTITE GRAPHS

EDGE DOMATIC NUMBERS OF COMPLETE N-PARTITE GRAPHS

... i Department of Information Engineering, Feng Chia University, Taichung 40724, Taiwan 2 Institute of Applied Mathematics, National Chiao Tung University, Hsinchu 30050, Taiwan.. An e[r] ... See full document

8

A characterization of bipartite distance-regular graphs

A characterization of bipartite distance-regular graphs

... that the halved graphs of a bipartite distance- regular graph are ...that the converse does not ...when the converse is ...characterization of a connected bipartite ... See full document

13

A study of the total chromatic number of equibipartite graphs

A study of the total chromatic number of equibipartite graphs

... In order to obtain a good necessary condition for a type 1 maximal equibipartite graph with maximal degree n - 1 (hopefully this condition is also sufficient), [r] ... See full document

12

The decay number and the maximum genus of diameter 2 graphs

The decay number and the maximum genus of diameter 2 graphs

... that the preceding formula, together with Theorem 1.3, yields another proof of Theorem ...concerns the extremal graphs of Theorems ...are the same, with the exception ... See full document

7

Show all 10000 documents...