Batas Bilangan Ajaib Pada Graph Caterpillar
نویسندگان
چکیده
منابع مشابه
Maximal independent sets in a generalisation of caterpillar graph
A caterpillar graph is a tree which on removal of all its pendant vertices leaves a chordless path. The chordless path is called the backbone of the graph. The edges from the backbone to the pendant vertices are called the hairs of the caterpillar graph. Ortiz and Villanueva (C.Ortiz and M.Villanueva, Discrete Applied Mathematics, 160(3): 259-266, 2012) describe an algorithm, linear in the size...
متن کاملThe Proper Interval Colored Graph Problem for Caterpillar Trees
This paper studies the computational complexity of the Proper interval colored graph problem (picg), when the input graph is a colored tree. We show that the problem is hard for the class of caterpillar trees. To prove our result we make use of a close relationship between intervalizing problems and graph layout problems. We deene a graph layout problem the Proper colored layout problem (pclp)....
متن کاملSubanta pada analyzer for Sanskrit
Natural language processing has wide coverage in application areas like machine translation , text to speech conversion , semantic analysis , semantic role labeling and knowledge representation .Morphological and syntactic processing are components of NLP which process each word to produce the syntactic structure of the sentence, with respect to its grammar .Semantic analysis follows syntactic ...
متن کاملCaterpillar compaction
Caterpillar compaction NA compaction, say Ryan Case, YunPei Chang, Nicholas Cozzarelli, Carlos Bustamante, and colleagues (University of California, Berkeley, CA), may work via a cooperative caterpillar-like mechanism. The caterpillar is formed by multiple copies of condensin protein—in this case MukBEF—with each V-shaped condensin contributing two legs. Compaction occurs when the caterpillar’s...
متن کاملCaterpillar Tolerance Representations
Various families of tolerance graphs of subtrees for specific families of host trees and tolerance functions have been successfully characterized. For example, chordal graphs are intersection (tolerance 1) graphs of subtrees of general trees, see [2], [5], and [8]. Intersection graphs of subtrees of a path are those that are chordal and do not contain an asteroidal triple, see [7]. We denote by...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Limits: Journal of Mathematics and Its Applications
سال: 2006
ISSN: 2579-8936,1829-605X
DOI: 10.12962/j1829605x.v3i2.1397