Search
Didn't find any results in this catalog!
But we have some results in other catalogs.Filters
total: 1282
-
Catalog
displaying 1000 best results Help
Search results for: UNICYCLIC GRAPHS
-
On domination multisubdivision number of unicyclic graphs
PublicationThe paper continues the interesting study of the domination subdivision number and the domination multisubdivision number. On the basis of the constructive characterization of the trees with the domination subdivision number equal to 3 given in [H. Aram, S.M. Sheikholeslami, O. Favaron, Domination subdivision number of trees, Discrete Math. 309 (2009), 622–628], we constructively characterize all connected unicyclic graphs with...
-
Unicyclic graphs with equal total and total outer-connected domination numbers
PublicationLet G = (V,E) be a graph without an isolated vertex. A set D ⊆ V (G) is a total dominating set if D is dominating and the in- duced subgraph G[D] does not contain an isolated vertex. The total domination number of G is the minimum cardinality of a total domi- nating set of G. A set D ⊆ V (G) is a total outer–connected dominating set if D is total dominating and the induced subgraph G[V (G)−D] is a connected graph. The total outer–connected...
-
GRAPHS AND COMBINATORICS
Journals -
Scheduling with precedence constraints: mixed graph coloring in series-parallel graphs.
PublicationW pracy rozważono problem kolorowania grafów mieszanych, opisujący zagadnienie szeregowania zadań, w którym zależności czasowe zadań mają charakter częściowego porządku lub wzajemnego wykluczania. Dla przypadku, w którym graf zależności jest szeregowo-równoległy, podano algorytm rozwiązujący problem optymalnie w czasie $O(n^3.376 * log n)$.
-
Discussiones Mathematicae Graph Theory
Journals -
Connection graphs
Publication -
Preparation of bicyclic β-lactam and bicyclic 1,3- oxazinone scaffolds using combined cycloaddition and metathesis processes
PublicationA simple, efficient two-step method for the preparation of heterobicyclic compounds was developed. Starting from 5-acyl or 5-carbamoyl-2,2- dimethyl-1,3-dioxa-4,5-dione bicyclic scaffolds of 1-azabicyclo[5.2.0]non- 3-en-9-one, 6,9,10,10a-tetrahydro-4H-[1,3]oxazino[3,2-a]azepin-4-one, and 6,9,10,10a-tetrahydro-2H-[1,3]oxazino[3,2-a]azepine-2,4(3H)-dione were prepared using cycloaddition of thermally generated ketenes to aldimines...
-
On the deficiency of bipartite graphs
Publication -
Dynamic coloring of graphs
PublicationDynamics is an inherent feature of many real life systems so it is natural to define and investigate the properties of models that reflect their dynamic nature. Dynamic graph colorings can be naturally applied in system modeling, e.g. for scheduling threads of parallel programs, time sharing in wireless networks, session scheduling in high-speed LAN's, channel assignment in WDM optical networks as well as traffic scheduling. In...
-
2-bondage in graphs
PublicationA 2-dominating set of a graph G=(V,E) is a set D of vertices of G such that every vertex of V(G)D has at least two neighbors in D. The 2-domination number of a graph G, denoted by gamma_2(G), is the minimum cardinality of a 2-dominating set of G. The 2-bondage number of G, denoted by b_2(G), is the minimum cardinality among all sets of edges E' subseteq E such that gamma_2(G-E') > gamma_2(G). If for every E' subseteq E we have...