[PDF] Top 20 Maximal independent sets in graphs with at most one cycle
Has 10000 "Maximal independent sets in graphs with at most one cycle" found on our website. Below are the top 20 most common "Maximal independent sets in graphs with at most one cycle".
Maximal independent sets in graphs with at most one cycle
... Jou, The Number of Maximal Independent Sets in Graphs, Master Thesis, Department of Mathematics, National Central University, Taiwan, 199 I. Liu, Maximal independent [r] ... See full document
7
Cycle embedding in faulty wrapped butterfly graphs
... Hamiltonian cycle if it has at most two faults containing at least one vertex ...butterfly graphs are bipartite if and only if n is ...are in the same partite ... See full document
12
All graphs with maximum degree three whose complements have 4-cycle decompositions
... 8}}. In either case, G contains two vertices u and v of degree 1 whose neighbors w and x, respectively, are ...4-cycles in a 4-cycle system of K 2,4 ...on at most 12 vertices are listed ... See full document
9
Cycle Embedding on the Edge Fault Star Graphs
... Star Graphs Tseng-Kuei Li ∗ Abstract The star graph is one of the famous interconnection ...the cycle embedding problem is widely discussed in many researches. In this paper, we show ... See full document
9
Directed 3-cycle decompositions of complete directed graphs with quadratic leaves
... T with triangles is a partition of the edge set of a subgraph G of T , each element of which induces a triangle; the remainder graph of this packing, also known as the leave, is the subgraph T − G formed from T by ... See full document
11
A finiteness theorem for maximal independent sets
... of maximal independent sets possible in a graph with p vertices and that of deter- mining which graphs have this many maximal independent sets... ErdSs and Moser actuall[r] ... See full document
6
Feedback Vertex Sets in Star Graphs
... prevention in operating ...deadlock in a system can be described by using a wait-for graph [14]. In a wait-for graph, each vertex represents a process, and the existence of an edge (i, j) indicates ... See full document
13
Any maximal planar graph with only one separating triangle is hamiltonian
... graph, maximal planar graph, hamiltonian cycle, separating triangle, NP-complete ...notation in graphs are standard; see Chartrand and Lensniak (1981) and West (1996), except as ...indicated. ... See full document
8
Maximal sets of hamilton cycles in K(2p)-F
... cycles in a graph T is said to be maximal if the hamilton cycles in S form a subgraph of T such that T − E(S) has no hamilton ...a maximal set of m edge-disjoint hamilton ...complete ... See full document
8
The Mutually Independent Edge-Bipancyclic Property in Hypercube Graphs
... A cycle C = hv 0 , v 1 , · · · , v m , v 0 i is a sequence of adjacent ...edges in P . The length of a cycle C is the number of edges in ... See full document
5
The construction of mutually independent Hamiltonian cycles in bubble-sort graphs
... G with its vertex set S and with its edge set consisting of all edges of G joining any two vertices in ... with no repeated vertex and (v i , v i +1 ) is an edge of G for every i, 0 ≤ i ≤ k − ... See full document
16
Mutually independent hamiltonian cycles for the pancake graphs and the star graphs
... mutually independent hamiltonian cycles Mutually independent hamiltonicity of graphs can be applied to many ...scenario. In Christmas, we have a holiday of ...stay in each local area is ... See full document
10
Bottleneck independent domination on some classes of graphs
... N): In this case, Ω must be a cycle within a subgraph induced by {x i , a i , x i , b i , d i , q i }, for some ...exists in Ω is simple. Case 3. Ω ⊆ P ∪ X: Since all vertices in X are ... See full document
8
Mutually independent hamiltonian cycles of binary wrapped butterfly graphs
... performance in multiprocessor/communication systems. In this paper, the mutually independent hamiltonicity is addressed for its effective utilization of resources on the binary wrapped butterfly ... See full document
12
Fault-free mutually independent Hamiltonian cycles of faulty star graphs
... exactly one Hamiltonian cycle into an injured star network, this paper addresses the maximum number of fault- free mutually independent Hamiltonian cycles in the faulty star ...network ... See full document
18
Disjoint cycles in hypercubes with prescribed vertices in each cycle
... hamiltonian graphs and consider two or more cycles spanning a whole ...cyclable with respect to A 1 , A 2 , ...cyclable with respect to any r mutually disjoint vertex subsets if r ≥ ...cyclable ... See full document
13
Maximal sets of Hamilton cycles in Dn
... a maximal set S of m edge-disjoint Hamilton cycles in the complete graph K n if and only if (n + 3)/4m(n − ...1)/2. In paper [1], Bryant et al. showed that there exists a maximal set S ... See full document
5
FINDING THE MOST VITAL EDGE WITH RESPECT TO MINIMUM SPANNING TREE IN WEIGHTED GRAPHS
... Department of Information and Computer Science, National Chiao Tung University, Hsinchu 30050, Taiwan, ROC.. Maw-Sheng Chern.[r] ... See full document
5
Circular chromatic numbers of distance graphs with distance sets missing multiples
... 2000 Academic Press c 1. I NTRODUCTION Given a set D of positive integers, the distance graph G (Z, D) has all integers as vertices, and two vertices are adjacent if and only if their difference is in D; that is, ... See full document
8
Characterizing Projective Spaces for Varieties with at Most Quotient Singularities
... completely in X sing (the locus where the stack X is ...variety with quotient singular- ities and X a proper smooth Deligne-Mumford stack such that π : X → X is isomorphic over X reg = X − X sing and X is a ... See full document
15
相關主題