Results 41 to 50 of about 342,995 (169)
Treewidth versus clique number. II. Tree-independence number
Journal of Combinatorial Theory, Series BIn 2020, we initiated a systematic study of graph classes in which the treewidth can only be large due to the presence of a large clique, which we call $(\mathrm{tw},ω)$-bounded. While $(\mathrm{tw},ω)$-bounded graph classes are known to enjoy some good algorithmic properties related to clique and coloring problems, it is an interesting open problem ...
Dallard, Clément +2 more
openaire +2 more sources
Independent Component Analysis and Number of Independent Basis Vectors
Procedia Computer Science, 2015 AbstractAmong the various biometric systems, face recognition is an important area of research due to its applications in Human Computer Interaction, biometrics and security. It is one of the most popular research areas in the field of computer vision and pattern recognition.
Borade, Sushma Niket +2 more
openaire +1 more source
On the Total Graph of Mycielski Graphs, Central Graphs and Their Covering Numbers
Discussiones Mathematicae Graph Theory, 2013 The technique of counting cliques in networks is a natural problem. In this paper, we develop certain results on counting of triangles for the total graph of the Mycielski graph or central graph of star as well as completegraph families.
Patil H.P., Pandiya Raj R.
doaj +1 more source
Two Degree Distance Based Topological Indices of Chemical Trees
IEEE Access, 2019 Let G = (VG, EG) be a simple and connected graph. The eccentric connectivity index of G is represented as ξc(G) = Σx∈VG degG(x)ecG(x), where degG(x) and ecG(x) represent the degree and the eccentricity of x, respectively.
Shehnaz Akhter
doaj +1 more source
New Results Relating Independence and Matchings
Discussiones Mathematicae Graph Theory, 2022 In this paper we study relationships between the matching number, written µ(G), and the independence number, written α(G).
Caro Yair, Davila Randy, Pepper Ryan
doaj +1 more source
Independence number of generalized Petersen graphs
, 2010 Determining the size of a maximum independent set of a graph $G$, denoted by $ (G)$, is an NP-hard problem. Therefore, many attempts are made to find upper and lower bounds, or exact values of $ (G)$ for special classes of graphs. This paper is aimed toward studying this problem for the class of generalized Petersen graphs.
Besharati, Nazli +2 more
openaire +3 more sources
On Generalized Sierpiński Graphs
Discussiones Mathematicae Graph Theory, 2017 In this paper we obtain closed formulae for several parameters of generalized Sierpiński graphs S(G, t) in terms of parameters of the base graph G. In particular, we focus on the chromatic, vertex cover, clique and domination numbers.
Rodríguez-Velázquez Juan Alberto +2 more
doaj +1 more source
On the strength and independence number of graphs [PDF]
Contributions to Mathematics, 2022 Rikio Ichishima +2 more
doaj +1 more source
Looseness and Independence Number of Triangulations on Closed Surfaces
Discussiones Mathematicae Graph Theory, 2016 The looseness of a triangulation G on a closed surface F2, denoted by ξ (G), is defined as the minimum number k such that for any surjection c : V (G) → {1, 2, . . . , k + 3}, there is a face uvw of G with c(u), c(v) and c(w) all distinct. We shall bound
Nakamoto Atsuhiro +3 more
doaj +1 more source
Z3-connectivity with independent number 2
, 2014 11 pages,3 ...
Yang, Fan, Li, Xiangwen, Li, Liangchen
openaire +3 more sources