GENERALIZED TRACEABILITY CODES
|
|
- Delphia Blankenship
- 6 years ago
- Views:
Transcription
1 U.P.B. Sci. Bull., Series A, Vol. 78, Iss. 2, 2016 ISSN GENERALIZED TRACEABILITY CODES Majid MAZROOEI 1, Ali ZAGHIAN 2 In this paper, we introduce generalizations of frameproof, secure frameproof, traceability and identifiable parent property codes and will study some of their basic combinatorial properties. Keywords: Frameproof, Identifiable parent property, Hash family, Traceability. 1. Introduction Throughout this paper, is an alphabet of size and is a q array code of length. If =, then we call an (,, ) code. The elements of are called code words and each code word will have the form,...,, where, 1. The matrix representation of the code, denoted H(), is an matrix on symbols where each row of the matrix corresponds to one of the code words. Codes providing some forms of traceability (TA, for short) to protect copyrighted digital data against piracy have been extensively studied in the recent years. The weak forms of such codes are frameproof codes introduced by Boneh and Shaw [2], and secure frameproof codes. The more strong form of these codes are identifiable parent property (IPP, for short) codes which have been introduced by Hollmann, Van Lint, Linnartz and Tolhuizen [4] and defined as follows. Let be a -array code. For any subset of code words, the set of descendants of, denoted desc( ), is defined by desc,1. Thus desc( ) consists of all tuples that could be produced by a coalition holding the code words in. If desc( ), then we say that produces. Let be an integer. Define the descendant code, denoted desc, as follows: desc desc, Thus desc consists of all tuples that could be produced by some coalition of size at most. Now the code is called an,,, identifiable parent property code ( IPP) provided that, for all desc, it holds that 1 Assistant Prof., Dept.of Mathematical Sciences, University of Kashan, Isfahan, Iran, P. O. Box: , m.mazrooei@kashanu.ac.ir 2 Assistant Prof., Dept. of Mathematics, Malek Ashtar University of Technology, Isfahan, Iran, P. O. Box: , a_zaghian@mut-es.ac.ir
2 206 Majid Mazrooei, Ali Zaghian : desc, Another strong versions of such codes are TA schemes and TA codes introduced by Chor, Fiat and Naor in [3]. In fact, TA codes turn out to be a subclass of IPP codes and are defined as follows. Let define, for any,. Suppose is an (,, ) code and 2 is an integer. is called a traceability code ( TA) provided that, for all and all desc, and, there is at least one code word such that,, for any. Combinatorial properties of IPP codes and TA codes have been studied by Staddon, Stinson and Wei [9], Sarkar and Stinson [7], Barg, et al. [1], and also in [11]. The question of traitor tracing algorithms for IPP and TA codes is treated in [8], e.g. certain classes of TA codes are shown to have a faster tracing algorithm than their initially known linear runtime by using the list decoding techniques. New results on bounds of frame-proof codes and TA schemes can be found in [6]. Recently, a major theoretical challenge is to derive more codes which have efficient tracing algorithms. To do this, some authors have given some generalizations of IPP and TA codes. Sarkar and Stinson [7] defined an (,,,, ) IPP code as a code with the property that for every coalitions (1 ),..., of, each of size at most, desc implies. They have studied this generalization in part. For example, they proved that a code is an (,,, 2) IPP code if and only if it is an (,,, 2, 3) IPP code. Another generalization is given by Wu and Sattar [12] for TA codes. They have defined TA codes relative to any well-defined metric and an efficient tracing algorithm is presented for Lee-metric TA codes. In this paper, we introduce new generalizations of frame-proof, secure frame-proof, identifiable parent property and traceability codes and will study them. 2. Generalized Traceability Codes From now,,..., : are maps and α = {,..., }. For any and for any, let,..., and. For any subset of code words, we define the set of descendants of, denoted desc ( ), by desc, 1. Now, for any integer 2 define the (, ) descendant code, denoted desc,, as follows: desc, desc,
3 Generalized traceability codes 207 Definition 2.1 Let be an (,, ) code and 2 be an integer. We say that: 1. (, ) Frameproof code: is an (,,,, ) frameproof code ((, ) FP), if for any of size at most, desc implies. 2. (, ) Secure frameproof code: is an (,,,, ) secure frameproof code ((, ) SFP), if for any subsets, of of cardinality at most, desc desc implies. 3. (, ) Traceability code: is an (,,,, )-traceability code ((, ) TA) if for any of cardinality at most and for any desc, there exists such that,, for all. 4. (, ) Identifiable parent property code: is an (,,,, ) identifiable parent property code ((, ) IPP) provided that, for all desc,, it holds that :,desc Note that the original definitions of FP, SFP, IPP and TA codes will be obtained if we take,...,, where,1, is the natural projection on the th component. Our first result determines the relations between our generalized traceability codes. Proposition 2.2. The following relationships hold for any (,, ) code. (, ) TA (, ) IPP (, ) SFP (, ) FP. Proof. Assume that is an (,,,, ) TA code. We show that is an (, ) IPP code. Let desc,. Then there exists,, such that desc. Let such that,, for all. Thus,, for any by assumption. We show that for any,, desc implies, which proves that is an (, ) IPP code. By assumption, there is such that,, for any. If, then we will have,,, which is a contradiction. Hence. It is easy to see that any (, ) IPP code is an (, ) SFP code. We just prove that if C is an (, ) SFP code, then is an (, ) FP code. Let be a subset of of size at most and desc. Thus there exists a code word such that. Let. Then desc. By assumption, we have showing that. Hence which completes the proof. Proposition 2.3. Let be an (,, ) code and let min,,,. Assume that 2 is an integer such that 1. Then is an (, ) TA code.
4 208 Majid Mazrooei, Ali Zaghian Proof. Let 1 and 1. Assume that,, be a set of code words and desc 0. For any desc 0, let max, and min desc. For any and, we have, which shows that,. On the other hand, we have,. Thus for any desc 0. Hence. Now let be a code word such that,. Then for any we have,,. This completes the proof. Example 2.4. Let and 100, 411, 511. Define the maps 1,2,3 such that 100 2, and for 1, 2, 3. Then we have 3 4. This shows that is an (3, 3, 11,, 2) TA code while is not a TA code. 3. Generalized Traceability Codes and Hash Families A finite set of functions, where, is called an (,, ) hash family, denoted by (,, ) HF. An (,, ) HF can be presented as an matrix on symbols, where each column of the matrix corresponds to one of the functions in. Sometimes it is easier to consider hash families as such matrices. Definition 3.1. We consider the following kinds of hash families. 1. Perfect hash family: An (,, ) HF is called an (,,, ) perfect hash family ((,,, ) PHF) if for any subset of of size, there is a function H such that is injective on. 2. Separating hash family: An (,, ) HF is called an (,,,, ) separating hash family ((,,,, ) SHF) if for any disjoint subsets, of with and, there is a function such that and are also disjoint. The following theorem, due to Staddon, Stinson and Wei [9], makes a connection between perfect hash families and IPP codes. Theorem 3.2. Let be an (,, ) code whose matrix representation is C. If C is an (,,, 2 /4) PHF, then is an (,,, ) IPP code. Stinson, Van Trung and Wei [10] obtained another connections between (secure) frame-proof codes and separating hash families, which is stated in the following theorem. Theorem A code is an (,,, ) FP code iff is an (,,,, 1) SHF. 2. A code is an (,,, ) SFP code iff is an (,,,, ) SHF.
5 Generalized traceability codes 209 In this section, we will derive similar results of our generalizations of FP, SFP and IPP codes. Before it, we need the following definition. Definition 3.4. Let be an (,, ) code,,..., be maps and,...,. We say that is an injective family if for any,, implies. Proposition 3.5. Let be an (,, ) code and 2 be an integer. If is an (,,,, 1) SHF, then is an (, ) FP code. The converse holds if is an injective family. Proof. Assume that, and desc. Thus there exists such that. We claim that which show that is an (, ) FP code. Let. if then. Hence, by assumption, there is 1 such that, which is a contradiction because desc. Now assume that is an (, ) FP code and α is an injective family. We prove that is an (,,,, 1) SHF. If not, then there exist disjoint subsets, of with 1 and such that for any 1, 1. This shows that there is a code word such that desc. Since is an (, ) FP code,. Thus there exists such that, which, by our assumption, implies. Hence, a contradiction. Thus is an (,,,, 1) SHF. Proposition 3.6. Let be an (,, ) code and 2 be an integer. Then is an (, ) SFP code iff is an (,,,, ) SHF. Proof. Assume that is an (, ) SFP code. We show that is an (,,,, ) SHF. If not, then there exist disjoint subsets, of, both of size, such that 0 1 for all 1. This shows that for any 1, there exists and such that. Hence desc desc, which is a contradiction because is an (, ) SFP code. Hence should be an (,,,, ) SHF. Conversely, assume that is an (,,,, ) SHF. We prove that is an (, ) SFP code. Let, be disjoint subsets of both of size. We shall show that desc desc. By assumption, there exists 1 such that. This shows that desc desc, as desired. Proposition 3.7. Let be an (,,,, ) IPP code where 1. Then the set,..., is an (,,, 1) PHF. Proof. If not, then there is such that 1 and for any 1, there are such that. Let,...,. Then for any, we have desc where.
6 210 Majid Mazrooei, Ali Zaghian But for any, and we have which contradicts the fact that is an (, ) IPP code. Hence the set is an (,,, 1) PHF. Proposition 3.8. A code is an (,,,, 2) IPP code iff the family is both an (,,, 3) PHF and an (,,, 2, 2) SHF. Proof. If is an (,,,, 2) IPP code then is both an (,,, 3) PHF and an (,,, 2, 2) SHF by propositions 3.6 and 3.7. Assume that is both an (,,, 3) PHF and an (,,, 2, 2) SHF. We show that is an (,,,, 2) IPP code. Let desc, 1,...,, where,, 1, are distinct subsets of. If, then by assumption, there exists 1 such that, which is a contradiction because desc desc. Hence. Without loss of generality we may assume that. Note that in this case we have. We claim that for all 3,...,. If not, then there exists 3 such that. Since, we will have. Similarly,. Hence,. By assumption, there exists 1 such that, and are distinct. Now there are 2 cases: Case 1. : In this case we will have desc, which is a contradiction. Case 2. : In this case we will have desc, which is a contradiction. Hence for all 1,...,, as desired. Theorem 3.9. Let be an (,, ) code. If the family,..., is an (,,, 2 /4) PHF, then is an (, ) IPP code. Proof. If not, then there exist desc, such that. : desc C, C Let : desc C, C and define min :,. Without loss of generality, we may assume that,..., is a family of distinct elements of which have no common code words and for any 1, desc. Let,...,. Hence for any 1, there exists, such that. This shows that for any 1, we have,..., 1. which implies 1 2. Since is an integer, the last inequality shows that 22 /4. Now, since is an (,,, ) PHF,
7 Generalized traceability codes 211 there exists 1 such that,..., are distinct. On the other hand, there exists 1 such that. Also there is some such that. Since there is no code word such that, we have desc which is a contradiction. Hence is an (, ) IPP code. In [5], it is proved that if, then there exists an (,,, ) PHF. Hence we have the following corollary. Corollary Let be an (,, ) code and 2 be an integer such that that is an (, ) IPP code. 4. Conclusion. Then there are maps,..., such We generalized and studied codes providing some forms of traceability (FP, SFP, TA and IPP codes) to generate new families of such codes. Our generalized traceability codes enjoy the basic combinatorial properties of original ones. This motivates us to study decoding algorithms of our families in the future. Acknowledgement The first author is partially supported by the University of Kashan under grant number /1. R E F E R E N C E S [1]. A. Barg, G. Cohen, S. Encheva, G. Kabatiansky and G. Zemor, A hypergraph approach to the identifying parent property: the case of multiple parents, SIAM J. Discrete. Math., 14 (2001), [2]. D. Boneh and M. Franklin, An efficient public key traitor tracing schemes, Advances in Cryptography - Crypto' 94 (Lecture Notes in Computer Science), Springer-Verlag 839 (1994), [3]. B. Chor, A. Fiat and M. Naor, Tracing Traitors, Advances in Cryptography - Crypto' 94 (Lecture Notes in Computer Science), Springer-Verlag 839 (1994), [4]. H. D. L. Hollmann, J. H. Van Lint, J. P. LinnartzL. M. G. M. Tulhuizen, On codes with identifiable parent property, J. Comp. Theory A, 82 (1998), [5]. K. Mehlhorn, On the program size of perfect and universal hash functions, Proceedings of the 23rd IEEE Symposium of Foundations of Computer Science (1982), [6]. R. Safavi-Naini and Y. Wang, New results on frameproof codes and traceability schemes, IEEE Trans. Infom. Theory, 47 (2001), [7]. P. Sarkar, D. R. Stinson, Frameproof and IPP codes, Progress in Cryptography (Lecture Notes in Computer Science), 2247 (2001),
8 212 Majid Mazrooei, Ali Zaghian [8]. A. Silverberg, J. N. Staddon and J. L. Walker, Efficient traitor tracing algorithms using list decoding, ASIACRYPT 2001 (Lecture Notes in Computer Sciences), 2248 (2001), [9]. J. N. Staddon, D. R. Stinson and R. Wei, Combinatorial properties of frameproof and traceability codes, IEEE Trans. Infom. Theory, 47 (2001), [10]. D. R. Stinson, T. Van Trung and R. Wei, Secure frameproof codes, key distribution patterns, group testing algorithms and related structures, J. Statistical Planning and Inference, 86 (2000), [11]. T. V. Trung and S. Martirosyan}, On a class of traceability codes, Designs, Codes and Cryptography, 31 (2004), [12]. Xin-Wen Wu and Abdul Sattar, A new class of traceability schemes for protecting digital content against illegal re-distribution, IJCSNS Int. J. Comput. Sci. and Net. Sec., Vol. 11, 12 (2011).
ON THE EMPTY CONVEX PARTITION OF A FINITE SET IN THE PLANE**
Chin. Ann. of Math. 23B:(2002),87-9. ON THE EMPTY CONVEX PARTITION OF A FINITE SET IN THE PLANE** XU Changqing* DING Ren* Abstract The authors discuss the partition of a finite set of points in the plane
More informationIntroduction. Fingerprinting
Traitor Tracing Outline Introduction State of the art Traceability scheme Frameproof code c-secure code Combinatorial properties Tracing algorithm Some useful properties Rephrase Encoding scheme Decoding
More informationThe strong chromatic number of a graph
The strong chromatic number of a graph Noga Alon Abstract It is shown that there is an absolute constant c with the following property: For any two graphs G 1 = (V, E 1 ) and G 2 = (V, E 2 ) on the same
More informationMinimum Cycle Bases of Halin Graphs
Minimum Cycle Bases of Halin Graphs Peter F. Stadler INSTITUTE FOR THEORETICAL CHEMISTRY AND MOLECULAR STRUCTURAL BIOLOGY, UNIVERSITY OF VIENNA WÄHRINGERSTRASSE 17, A-1090 VIENNA, AUSTRIA, & THE SANTA
More informationOptimality certificates for convex minimization and Helly numbers
Optimality certificates for convex minimization and Helly numbers Amitabh Basu Michele Conforti Gérard Cornuéjols Robert Weismantel Stefan Weltge May 10, 2017 Abstract We consider the problem of minimizing
More informationModule 7. Independent sets, coverings. and matchings. Contents
Module 7 Independent sets, coverings Contents and matchings 7.1 Introduction.......................... 152 7.2 Independent sets and coverings: basic equations..... 152 7.3 Matchings in bipartite graphs................
More informationSubdivided graphs have linear Ramsey numbers
Subdivided graphs have linear Ramsey numbers Noga Alon Bellcore, Morristown, NJ 07960, USA and Department of Mathematics Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv,
More informationLecture 5: Duality Theory
Lecture 5: Duality Theory Rajat Mittal IIT Kanpur The objective of this lecture note will be to learn duality theory of linear programming. We are planning to answer following questions. What are hyperplane
More informationLATIN SQUARES AND TRANSVERSAL DESIGNS
LATIN SQUARES AND TRANSVERSAL DESIGNS *Shirin Babaei Department of Mathematics, University of Zanjan, Zanjan, Iran *Author for Correspondence ABSTRACT We employ a new construction to show that if and if
More informationNew Constructions of Non-Adaptive and Error-Tolerance Pooling Designs
New Constructions of Non-Adaptive and Error-Tolerance Pooling Designs Hung Q Ngo Ding-Zhu Du Abstract We propose two new classes of non-adaptive pooling designs The first one is guaranteed to be -error-detecting
More informationTreewidth and graph minors
Treewidth and graph minors Lectures 9 and 10, December 29, 2011, January 5, 2012 We shall touch upon the theory of Graph Minors by Robertson and Seymour. This theory gives a very general condition under
More informationCharacterization of Super Strongly Perfect Graphs in Chordal and Strongly Chordal Graphs
ISSN 0975-3303 Mapana J Sci, 11, 4(2012), 121-131 https://doi.org/10.12725/mjs.23.10 Characterization of Super Strongly Perfect Graphs in Chordal and Strongly Chordal Graphs R Mary Jeya Jothi * and A Amutha
More informationThe Restrained Edge Geodetic Number of a Graph
International Journal of Computational and Applied Mathematics. ISSN 0973-1768 Volume 11, Number 1 (2016), pp. 9 19 Research India Publications http://www.ripublication.com/ijcam.htm The Restrained Edge
More informationMonochromatic path and cycle partitions in hypergraphs
Monochromatic path and cycle partitions in hypergraphs András Gyárfás Alfréd Rényi Institute of Mathematics Hungarian Academy of Sciences Budapest, P.O. Box 127 Budapest, Hungary, H-1364 gyarfas.andras@renyi.mta.hu
More informationParameterized graph separation problems
Parameterized graph separation problems Dániel Marx Department of Computer Science and Information Theory, Budapest University of Technology and Economics Budapest, H-1521, Hungary, dmarx@cs.bme.hu Abstract.
More informationAN APPROXIMATION APPROACH FOR RANKING FUZZY NUMBERS BASED ON WEIGHTED INTERVAL - VALUE 1.INTRODUCTION
Mathematical and Computational Applications, Vol. 16, No. 3, pp. 588-597, 2011. Association for Scientific Research AN APPROXIMATION APPROACH FOR RANKING FUZZY NUMBERS BASED ON WEIGHTED INTERVAL - VALUE
More informationFINGERPRINTING is an old cryptographic technique.
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 44, NO 5, SEPTEMBER 1998 1897 Collusion-Secure Fingerprinting for Digital Data Dan Boneh and James Shaw Abstract This paper discusses methods for assigning
More informationCrossing Families. Abstract
Crossing Families Boris Aronov 1, Paul Erdős 2, Wayne Goddard 3, Daniel J. Kleitman 3, Michael Klugerman 3, János Pach 2,4, Leonard J. Schulman 3 Abstract Given a set of points in the plane, a crossing
More informationMatching Algorithms. Proof. If a bipartite graph has a perfect matching, then it is easy to see that the right hand side is a necessary condition.
18.433 Combinatorial Optimization Matching Algorithms September 9,14,16 Lecturer: Santosh Vempala Given a graph G = (V, E), a matching M is a set of edges with the property that no two of the edges have
More informationThe Connectivity and Diameter of Second Order Circuit Graphs of Matroids
Graphs and Combinatorics (2012) 28:737 742 DOI 10.1007/s00373-011-1074-6 ORIGINAL PAPER The Connectivity and Diameter of Second Order Circuit Graphs of Matroids Jinquan Xu Ping Li Hong-Jian Lai Received:
More informationOn vertex types of graphs
On vertex types of graphs arxiv:1705.09540v1 [math.co] 26 May 2017 Pu Qiao, Xingzhi Zhan Department of Mathematics, East China Normal University, Shanghai 200241, China Abstract The vertices of a graph
More informationTHREE LECTURES ON BASIC TOPOLOGY. 1. Basic notions.
THREE LECTURES ON BASIC TOPOLOGY PHILIP FOTH 1. Basic notions. Let X be a set. To make a topological space out of X, one must specify a collection T of subsets of X, which are said to be open subsets of
More informationQED Q: Why is it called the triangle inequality? A: Analogue with euclidean distance in the plane: picture Defn: Minimum Distance of a code C:
Lecture 3: Lecture notes posted online each week. Recall Defn Hamming distance: for words x = x 1... x n, y = y 1... y n of the same length over the same alphabet, d(x, y) = {1 i n : x i y i } i.e., d(x,
More informationThe Set-Open topology
Volume 37, 2011 Pages 205 217 http://topology.auburn.edu/tp/ The Set-Open topology by A. V. Osipov Electronically published on August 26, 2010 Topology Proceedings Web: http://topology.auburn.edu/tp/ Mail:
More informationFURTHER APPLICATIONS OF CLUTTER DOMINATION PARAMETERS TO PROJECTIVE DIMENSION
FURTHER APPLICATIONS OF CLUTTER DOMINATION PARAMETERS TO PROJECTIVE DIMENSION HAILONG DAO AND JAY SCHWEIG Abstract. We study the relationship between the projective dimension of a squarefree monomial ideal
More informationSome bounds on chromatic number of NI graphs
International Journal of Mathematics and Soft Computing Vol.2, No.2. (2012), 79 83. ISSN 2249 3328 Some bounds on chromatic number of NI graphs Selvam Avadayappan Department of Mathematics, V.H.N.S.N.College,
More informationTOPOLOGY, DR. BLOCK, FALL 2015, NOTES, PART 3.
TOPOLOGY, DR. BLOCK, FALL 2015, NOTES, PART 3. 301. Definition. Let m be a positive integer, and let X be a set. An m-tuple of elements of X is a function x : {1,..., m} X. We sometimes use x i instead
More informationMathematical and Algorithmic Foundations Linear Programming and Matchings
Adavnced Algorithms Lectures Mathematical and Algorithmic Foundations Linear Programming and Matchings Paul G. Spirakis Department of Computer Science University of Patras and Liverpool Paul G. Spirakis
More informationOn Sequential Topogenic Graphs
Int. J. Contemp. Math. Sciences, Vol. 5, 2010, no. 36, 1799-1805 On Sequential Topogenic Graphs Bindhu K. Thomas, K. A. Germina and Jisha Elizabath Joy Research Center & PG Department of Mathematics Mary
More informationOn some subclasses of circular-arc graphs
On some subclasses of circular-arc graphs Guillermo Durán - Min Chih Lin Departamento de Computación Facultad de Ciencias Exactas y Naturales Universidad de Buenos Aires e-mail: {willy,oscarlin}@dc.uba.ar
More informationFormally Self-Dual Codes Related to Type II Codes
Formally Self-Dual Codes Related to Type II Codes Koichi Betsumiya Graduate School of Mathematics Nagoya University Nagoya 464 8602, Japan and Masaaki Harada Department of Mathematical Sciences Yamagata
More informationRoman Domination in Complementary Prism Graphs
International J.Math. Combin. Vol.2(2012), 24-31 Roman Domination in Complementary Prism Graphs B.Chaluvaraju and V.Chaitra 1(Department of Mathematics, Bangalore University, Central College Campus, Bangalore
More informationAMS /672: Graph Theory Homework Problems - Week V. Problems to be handed in on Wednesday, March 2: 6, 8, 9, 11, 12.
AMS 550.47/67: Graph Theory Homework Problems - Week V Problems to be handed in on Wednesday, March : 6, 8, 9,,.. Assignment Problem. Suppose we have a set {J, J,..., J r } of r jobs to be filled by a
More informationOptimality certificates for convex minimization and Helly numbers
Optimality certificates for convex minimization and Helly numbers Amitabh Basu Michele Conforti Gérard Cornuéjols Robert Weismantel Stefan Weltge October 20, 2016 Abstract We consider the problem of minimizing
More informationOn the extending of k-regular graphs and their strong defining spectrum
On the extending of k-regular graphs and their strong defining spectrum Doost Ali Mojdeh Department of Mathematics University of Mazandaran P. O. Box 47416-1467 Babolsar Iran Abstract In a given graph
More informationStrong Dominating Sets of Some Arithmetic Graphs
International Journal of Computer Applications (09 888) Volume 8 No, December 01 Strong Dominating Sets of Some Arithmetic Graphs MManjuri Dept of Applied Mathematics, SPWomen s University, Tirupati-10,
More informationDisjoint directed cycles
Disjoint directed cycles Noga Alon Abstract It is shown that there exists a positive ɛ so that for any integer k, every directed graph with minimum outdegree at least k contains at least ɛk vertex disjoint
More informationGEOMETRIC DISTANCE-REGULAR COVERS
NEW ZEALAND JOURNAL OF MATHEMATICS Volume 22 (1993), 31-38 GEOMETRIC DISTANCE-REGULAR COVERS C.D. G o d s i l 1 (Received March 1993) Abstract. Let G be a distance-regular graph with valency k and least
More informationLecture 5: Graphs. Rajat Mittal. IIT Kanpur
Lecture : Graphs Rajat Mittal IIT Kanpur Combinatorial graphs provide a natural way to model connections between different objects. They are very useful in depicting communication networks, social networks
More informationCSC Discrete Math I, Spring Sets
CSC 125 - Discrete Math I, Spring 2017 Sets Sets A set is well-defined, unordered collection of objects The objects in a set are called the elements, or members, of the set A set is said to contain its
More information9.5 Equivalence Relations
9.5 Equivalence Relations You know from your early study of fractions that each fraction has many equivalent forms. For example, 2, 2 4, 3 6, 2, 3 6, 5 30,... are all different ways to represent the same
More informationSome Upper Bounds for Signed Star Domination Number of Graphs. S. Akbari, A. Norouzi-Fard, A. Rezaei, R. Rotabi, S. Sabour.
Some Upper Bounds for Signed Star Domination Number of Graphs S. Akbari, A. Norouzi-Fard, A. Rezaei, R. Rotabi, S. Sabour Abstract Let G be a graph with the vertex set V (G) and edge set E(G). A function
More informationMath 5593 Linear Programming Lecture Notes
Math 5593 Linear Programming Lecture Notes Unit II: Theory & Foundations (Convex Analysis) University of Colorado Denver, Fall 2013 Topics 1 Convex Sets 1 1.1 Basic Properties (Luenberger-Ye Appendix B.1).........................
More informationAn Attack on A Traitor Tracing Scheme
An Attack on A Traitor Tracing Scheme Jeff Jianxin Yan 1 and Yongdong Wu 2 1 Computer Laboratory, University of Cambridge Jeff.Yan@cl.cam.ac.uk 2 Kent Ridge Digital Labs (KRDL), Singapore wydong@krdl.org.sg
More informationDegree Equitable Domination Number and Independent Domination Number of a Graph
Degree Equitable Domination Number and Independent Domination Number of a Graph A.Nellai Murugan 1, G.Victor Emmanuel 2 Assoc. Prof. of Mathematics, V.O. Chidambaram College, Thuthukudi-628 008, Tamilnadu,
More informationMonochromatic loose-cycle partitions in hypergraphs
Monochromatic loose-cycle partitions in hypergraphs András Gyárfás Alfréd Rényi Institute of Mathematics Hungarian Academy of Sciences Budapest, P.O. Box 27 Budapest, H-364, Hungary gyarfas.andras@renyi.mta.hu
More informationA SIGNATURE ALGORITHM BASED ON DLP AND COMPUTING SQUARE ROOTS
A SIGNATURE ALGORITHM BASED ON DLP AND COMPUTING SQUARE ROOTS Ounasser Abid 1 and Omar Khadir 2 1, 2 Laboratory of Mathematics, Cryptography and Mechanics, FSTM University Hassan II of Casablanca, Morocco
More informationOn the Relationships between Zero Forcing Numbers and Certain Graph Coverings
On the Relationships between Zero Forcing Numbers and Certain Graph Coverings Fatemeh Alinaghipour Taklimi, Shaun Fallat 1,, Karen Meagher 2 Department of Mathematics and Statistics, University of Regina,
More informationON SWELL COLORED COMPLETE GRAPHS
Acta Math. Univ. Comenianae Vol. LXIII, (1994), pp. 303 308 303 ON SWELL COLORED COMPLETE GRAPHS C. WARD and S. SZABÓ Abstract. An edge-colored graph is said to be swell-colored if each triangle contains
More informationSuper Connectivity of Iterated Line Digraphs
Super Connectivity of Iterated Line Digraphs Ding-Zhu Du Hung Q. Ngo Lu Ruan Jianhua Sun Abstract Many interconnection networks can be constructed with line digraph iterations. In this paper, we will establish
More informationHamiltonian cycles in bipartite quadrangulations on the torus
Hamiltonian cycles in bipartite quadrangulations on the torus Atsuhiro Nakamoto and Kenta Ozeki Abstract In this paper, we shall prove that every bipartite quadrangulation G on the torus admits a simple
More informationThe 3-Steiner Root Problem
The 3-Steiner Root Problem Maw-Shang Chang 1 and Ming-Tat Ko 2 1 Department of Computer Science and Information Engineering National Chung Cheng University, Chiayi 621, Taiwan, R.O.C. mschang@cs.ccu.edu.tw
More informationMatching and Factor-Critical Property in 3-Dominating-Critical Graphs
Matching and Factor-Critical Property in 3-Dominating-Critical Graphs Tao Wang a,, Qinglin Yu a,b a Center for Combinatorics, LPMC Nankai University, Tianjin, China b Department of Mathematics and Statistics
More informationarxiv: v1 [math.co] 7 Dec 2018
SEQUENTIALLY EMBEDDABLE GRAPHS JACKSON AUTRY AND CHRISTOPHER O NEILL arxiv:1812.02904v1 [math.co] 7 Dec 2018 Abstract. We call a (not necessarily planar) embedding of a graph G in the plane sequential
More informationCOMPUTABILITY THEORY AND RECURSIVELY ENUMERABLE SETS
COMPUTABILITY THEORY AND RECURSIVELY ENUMERABLE SETS JOSHUA LENERS Abstract. An algorithm is function from ω to ω defined by a finite set of instructions to transform a given input x to the desired output
More informationCollege of Computer & Information Science Fall 2007 Northeastern University 14 September 2007
College of Computer & Information Science Fall 2007 Northeastern University 14 September 2007 CS G399: Algorithmic Power Tools I Scribe: Eric Robinson Lecture Outline: Linear Programming: Vertex Definitions
More information2386 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 6, JUNE 2006
2386 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 6, JUNE 2006 The Encoding Complexity of Network Coding Michael Langberg, Member, IEEE, Alexander Sprintson, Member, IEEE, and Jehoshua Bruck,
More informationThe Encoding Complexity of Network Coding
The Encoding Complexity of Network Coding Michael Langberg Alexander Sprintson Jehoshua Bruck California Institute of Technology Email: mikel,spalex,bruck @caltech.edu Abstract In the multicast network
More informationarxiv: v2 [math.co] 13 Aug 2013
Orthogonality and minimality in the homology of locally finite graphs Reinhard Diestel Julian Pott arxiv:1307.0728v2 [math.co] 13 Aug 2013 August 14, 2013 Abstract Given a finite set E, a subset D E (viewed
More informationIndependence Number and Cut-Vertices
Independence Number and Cut-Vertices Ryan Pepper University of Houston Downtown, Houston, Texas 7700 pepperr@uhd.edu Abstract We show that for any connected graph G, α(g) C(G) +1, where α(g) is the independence
More informationA 2-APPROXIMATION ALGORITHM FOR THE MINIMUM KNAPSACK PROBLEM WITH A FORCING GRAPH. Yotaro Takazawa Shinji Mizuno Tokyo Institute of Technology
Journal of the Operations Research Society of Japan Vol. 60, No. 1, January 2017, pp. 15 23 c The Operations Research Society of Japan A 2-APPROXIMATION ALGORITHM FOR THE MINIMUM KNAPSACK PROBLEM WITH
More informationTheorem 3.1 (Berge) A matching M in G is maximum if and only if there is no M- augmenting path.
3 Matchings Hall s Theorem Matching: A matching in G is a subset M E(G) so that no edge in M is a loop, and no two edges in M are incident with a common vertex. A matching M is maximal if there is no matching
More information[Ramalingam, 4(12): December 2017] ISSN DOI /zenodo Impact Factor
GLOBAL JOURNAL OF ENGINEERING SCIENCE AND RESEARCHES FORCING VERTEX TRIANGLE FREE DETOUR NUMBER OF A GRAPH S. Sethu Ramalingam * 1, I. Keerthi Asir 2 and S. Athisayanathan 3 *1,2 & 3 Department of Mathematics,
More informationTopology and Topological Spaces
Topology and Topological Spaces Mathematical spaces such as vector spaces, normed vector spaces (Banach spaces), and metric spaces are generalizations of ideas that are familiar in R or in R n. For example,
More informationRandom Permutations, Random Sudoku Matrices and Randomized Algorithms
Random Permutations, Random Sudoku Matrices and Randomized Algorithms arxiv:1312.0192v1 [math.co] 1 Dec 2013 Krasimir Yordzhev Faculty of Mathematics and Natural Sciences South-West University, Blagoevgrad,
More informationSEQUENTIALLY COHEN-MACAULAY GRAPHS OF FORM θ n1,...,n k. Communicated by Siamak Yassemi. 1. Introduction
Bulletin of the Iranian Mathematical Society Vol. 36 No. 2 (2010), pp 109-118. SEQUENTIALLY COHEN-MACAULAY GRAPHS OF FORM θ n1,...,n k F. MOHAMMADI* AND D. KIANI Communicated by Siamak Yassemi Abstract.
More informationNOTE ON MINIMALLY k-connected GRAPHS
NOTE ON MINIMALLY k-connected GRAPHS R. Rama a, Suresh Badarla a a Department of Mathematics, Indian Institute of Technology, Chennai, India ABSTRACT A k-tree is either a complete graph on (k+1) vertices
More informationBar k-visibility Graphs
Bar k-visibility Graphs Alice M. Dean Department of Mathematics Skidmore College adean@skidmore.edu William Evans Department of Computer Science University of British Columbia will@cs.ubc.ca Ellen Gethner
More informationThe Resolution Algorithm
The Resolution Algorithm Introduction In this lecture we introduce the Resolution algorithm for solving instances of the NP-complete CNF- SAT decision problem. Although the algorithm does not run in polynomial
More informationAugmenting Trees so that Every Three Vertices Lie on a Cycle
Augmenting Trees so that Every Three Vertices Lie on a Cycle Peter Dankelmann School of Mathematical and Statistical Sciences, University of Natal, Durban, 4041, South Africa Wayne Goddard School of Geological
More informationCSE 20 DISCRETE MATH. Fall
CSE 20 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Final exam The final exam is Saturday December 16 11:30am-2:30pm. Lecture A will take the exam in Lecture B will take the exam
More informationTrail Making Game. Hyun Sung Jun Jaehoon Kim Sang-il Oum Department of Mathematical Sciences KAIST, Daejeon, , Republic of Korea.
Trail Making Game Hyun Sung Jun Jaehoon Kim Sang-il Oum Department of Mathematical Sciences KAIST, Daejeon, 305-701, Republic of Korea. May 7, 2009 Abstract Trail Making is a game played on a graph with
More informationConstruction C : an inter-level coded version of Construction C
Construction C : an inter-level coded version of Construction C arxiv:1709.06640v2 [cs.it] 27 Dec 2017 Abstract Besides all the attention given to lattice constructions, it is common to find some very
More informationDiscrete mathematics , Fall Instructor: prof. János Pach
Discrete mathematics 2016-2017, Fall Instructor: prof. János Pach - covered material - Lecture 1. Counting problems To read: [Lov]: 1.2. Sets, 1.3. Number of subsets, 1.5. Sequences, 1.6. Permutations,
More informationThe Structure of Bull-Free Perfect Graphs
The Structure of Bull-Free Perfect Graphs Maria Chudnovsky and Irena Penev Columbia University, New York, NY 10027 USA May 18, 2012 Abstract The bull is a graph consisting of a triangle and two vertex-disjoint
More informationThe Dual Neighborhood Number of a Graph
Int. J. Contemp. Math. Sciences, Vol. 5, 2010, no. 47, 2327-2334 The Dual Neighborhood Number of a Graph B. Chaluvaraju 1, V. Lokesha 2 and C. Nandeesh Kumar 1 1 Department of Mathematics Central College
More informationUnlabeled equivalence for matroids representable over finite fields
Unlabeled equivalence for matroids representable over finite fields November 16, 2012 S. R. Kingan Department of Mathematics Brooklyn College, City University of New York 2900 Bedford Avenue Brooklyn,
More informationForced orientation of graphs
Forced orientation of graphs Babak Farzad Mohammad Mahdian Ebad S. Mahmoodian Amin Saberi Bardia Sadri Abstract The concept of forced orientation of graphs was introduced by G. Chartrand et al. in 1994.
More informationExtremal Graph Theory: Turán s Theorem
Bridgewater State University Virtual Commons - Bridgewater State University Honors Program Theses and Projects Undergraduate Honors Program 5-9-07 Extremal Graph Theory: Turán s Theorem Vincent Vascimini
More informationDomination and Irredundant Number of 4-Regular Graph
Domination and Irredundant Number of 4-Regular Graph S. Delbin Prema #1 and C. Jayasekaran *2 # Department of Mathematics, RVS Technical Campus-Coimbatore, Coimbatore - 641402, Tamil Nadu, India * Department
More informationSharing Several Secrets based on Lagrange s Interpolation formula and Cipher Feedback Mode
Int. J. Nonlinear Anal. Appl. 5 (2014) No. 2, 60-66 ISSN: 2008-6822 (electronic) http://www.ijnaa.semnan.ac.ir Sharing Several Secrets based on Lagrange s Interpolation formula and Cipher Feedback Mode
More informationByzantine Consensus in Directed Graphs
Byzantine Consensus in Directed Graphs Lewis Tseng 1,3, and Nitin Vaidya 2,3 1 Department of Computer Science, 2 Department of Electrical and Computer Engineering, and 3 Coordinated Science Laboratory
More informationA Connection between Network Coding and. Convolutional Codes
A Connection between Network Coding and 1 Convolutional Codes Christina Fragouli, Emina Soljanin christina.fragouli@epfl.ch, emina@lucent.com Abstract The min-cut, max-flow theorem states that a source
More informationShannon capacity and related problems in Information Theory and Ramsey Theory
Shannon capacity and related problems in Information Theory and Ramsey Theory Eyal Lubetzky Based on Joint work with Noga Alon and Uri Stav May 2007 1 Outline of talk Shannon Capacity of of a graph: graph:
More informationLecture 6: Faces, Facets
IE 511: Integer Programming, Spring 2019 31 Jan, 2019 Lecturer: Karthik Chandrasekaran Lecture 6: Faces, Facets Scribe: Setareh Taki Disclaimer: These notes have not been subjected to the usual scrutiny
More informationThe crossing number of K 1,4,n
Discrete Mathematics 308 (2008) 1634 1638 www.elsevier.com/locate/disc The crossing number of K 1,4,n Yuanqiu Huang, Tinglei Zhao Department of Mathematics, Normal University of Hunan, Changsha 410081,
More informationOn the Graceful Cartesian Product of Alpha-Trees
Theory and Applications of Graphs Volume 4 Issue 1 Article 3 017 On the Graceful Cartesian Product of Alpha-Trees Christian Barrientos Clayton State University, chr_barrientos@yahoo.com Sarah Minion Clayton
More informationOn Jeśmanowicz Conjecture Concerning Pythagorean Triples
Journal of Mathematical Research with Applications Mar., 2015, Vol. 35, No. 2, pp. 143 148 DOI:10.3770/j.issn:2095-2651.2015.02.004 Http://jmre.dlut.edu.cn On Jeśmanowicz Conjecture Concerning Pythagorean
More informationSome Elementary Lower Bounds on the Matching Number of Bipartite Graphs
Some Elementary Lower Bounds on the Matching Number of Bipartite Graphs Ermelinda DeLaViña and Iride Gramajo Department of Computer and Mathematical Sciences University of Houston-Downtown Houston, Texas
More informationInterval-Vector Polytopes
Interval-Vector Polytopes Jessica De Silva Gabriel Dorfsman-Hopkins California State University, Stanislaus Dartmouth College Joseph Pruitt California State University, Long Beach July 28, 2012 Abstract
More information1 Matching in Non-Bipartite Graphs
CS 369P: Polyhedral techniques in combinatorial optimization Instructor: Jan Vondrák Lecture date: September 30, 2010 Scribe: David Tobin 1 Matching in Non-Bipartite Graphs There are several differences
More information1 Linear programming relaxation
Cornell University, Fall 2010 CS 6820: Algorithms Lecture notes: Primal-dual min-cost bipartite matching August 27 30 1 Linear programming relaxation Recall that in the bipartite minimum-cost perfect matching
More informationMultiple Vertex Coverings by Cliques
Multiple Vertex Coverings by Cliques Wayne Goddard Department of Computer Science University of Natal Durban, 4041 South Africa Michael A. Henning Department of Mathematics University of Natal Private
More informationA Fast Algorithm for Optimal Alignment between Similar Ordered Trees
Fundamenta Informaticae 56 (2003) 105 120 105 IOS Press A Fast Algorithm for Optimal Alignment between Similar Ordered Trees Jesper Jansson Department of Computer Science Lund University, Box 118 SE-221
More informationDefinition For vertices u, v V (G), the distance from u to v, denoted d(u, v), in G is the length of a shortest u, v-path. 1
Graph fundamentals Bipartite graph characterization Lemma. If a graph contains an odd closed walk, then it contains an odd cycle. Proof strategy: Consider a shortest closed odd walk W. If W is not a cycle,
More informationRESULTS ON HESITANT FUZZY SOFT TOPOLOGICAL SPACES
ISSN 2320-9143 1 International Journal of Advance Research, IJOAR.org Volume 4, Issue 3, March 2016, Online: ISSN 2320-9143 RESULTS ON HESITANT FUZZY SOFT TOPOLOGICAL SPACES A. Sreedevi, Dr.N.Ravi Shankar
More informationConnected size Ramsey number for matchings vs. small stars or cycles
Proc. Indian Acad. Sci. (Math. Sci.) Vol. 127, No. 5, November 2017, pp. 787 792. https://doi.org/10.1007/s12044-017-0366-z Connected size Ramsey number for matchings vs. small stars or cycles BUDI RAHADJENG,
More informationAbstract. A graph G is perfect if for every induced subgraph H of G, the chromatic number of H is equal to the size of the largest clique of H.
Abstract We discuss a class of graphs called perfect graphs. After defining them and getting intuition with a few simple examples (and one less simple example), we present a proof of the Weak Perfect Graph
More informationThe Lower and Upper Forcing Edge-to-vertex Geodetic Numbers of a Graph
International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Volume 4, Issue 6, June 2016, PP 23-27 ISSN 2347-307X (Print) & ISSN 2347-3142 (Online) DOI: http://dx.doi.org/10.20431/2347-3142.0406005
More informationREDUCING GRAPH COLORING TO CLIQUE SEARCH
Asia Pacific Journal of Mathematics, Vol. 3, No. 1 (2016), 64-85 ISSN 2357-2205 REDUCING GRAPH COLORING TO CLIQUE SEARCH SÁNDOR SZABÓ AND BOGDÁN ZAVÁLNIJ Institute of Mathematics and Informatics, University
More information