Relevant bibliographies by topics / Graph covering

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature on the topic 'Graph covering'

Author: Grafiati
Published: 4 June 2021
Last updated: 17 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Graph covering.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Graph covering"

1

GREEN, EDWARD L., SIBYLLE SCHROLL, and NICOLE SNASHALL. "GROUP ACTIONS AND COVERINGS OF BRAUER GRAPH ALGEBRAS." Glasgow Mathematical Journal 56, no. 2 (August 30, 2013): 439–64. http://dx.doi.org/10.1017/s0017089513000372.

Full text
Abstract:
AbstractWe develop a theory of group actions and coverings on Brauer graphs that parallels the theory of group actions and coverings of algebras. In particular, we show that any Brauer graph can be covered by a tower of coverings of Brauer graphs such that the topmost covering has multiplicity function identically one, no loops, and no multiple edges. Furthermore, we classify the coverings of Brauer graph algebras that are again Brauer graph algebras.
APA, Harvard, Vancouver, ISO, and other styles
2

Dogan, Derya, and Pinar Dundar. "The Average Covering Number of a Graph." Journal of Applied Mathematics 2013 (2013): 1–4. http://dx.doi.org/10.1155/2013/849817.

Full text
Abstract:
There are occasions when an average value of a graph parameter gives more useful information than the basic global value. In this paper, we introduce the concept of the average covering number of a graph (the covering number of a graph is the minimum number of vertices in a set with the property that every edge has a vertex in the set). We establish relationships between the average covering number and some other graph parameters, find the extreme values of the average covering number among all graphs of a given order, and find the average covering number for some families of graphs.
APA, Harvard, Vancouver, ISO, and other styles
3

Ciesielski, Krzysztof, and Janusz Pawlikowski. "Small Coverings with Smooth Functions under the Covering Property Axiom." Canadian Journal of Mathematics 57, no. 3 (June 1, 2005): 471–93. http://dx.doi.org/10.4153/cjm-2005-020-8.

Full text
Abstract:
AbstractIn the paper we formulate a Covering Property Axiom, CPAprism, which holds in the iterated perfect set model, and show that it implies the following facts, of which (a) and (b) are the generalizations of results of J. Steprāns.(a) There exists a family ℱ of less than continuummany functions from ℝ to ℝ such that ℝ2 is covered by functions from ℱ, in the sense that for every 〈x, y〉 ∈ ℝ2 there exists an f ∈ ℱ such that either f (x) = y or f (y) = x.(b) For every Borel function f : ℝ → ℝ there exists a family ℱ of less than continuum many “” functions (i.e., differentiable functions with continuous derivatives, where derivative can be infinite) whose graphs cover the graph of f.(c) For every n > 0 and a Dn function f: ℝ → ℝ there exists a family ℱ of less than continuum many Cn functions whose graphs cover the graph of f.We also provide the examples showing that in the above properties the smoothness conditions are the best possible. Parts (b), (c), and the examples are closely related to work of A. Olevskiĭ.
APA, Harvard, Vancouver, ISO, and other styles
4

Pirzadaa, Shariefuddin, Hilal A. Ganieb, and Merajuddin Siddique. "On some covering graphs of a graph." Electronic Journal of Graph Theory and Applications 1, no. 2 (October 8, 2016): 132–47. http://dx.doi.org/10.5614/ejgta.2016.4.2.2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Erdős, P., and L. Pyber. "Covering a graph by complete bipartite graphs." Discrete Mathematics 170, no. 1-3 (June 1997): 249–51. http://dx.doi.org/10.1016/s0012-365x(96)00124-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Kwon, Young Soo, and Jaeun Lee. "Enumerating Abelian Typical Cube-Free Fold Coverings of a Circulant Graph." Algebra Colloquium 27, no. 01 (February 25, 2020): 137–48. http://dx.doi.org/10.1142/s1005386720000127.

Full text
Abstract:
Enumerating the isomorphism or equivalence classes of several types of graph coverings is one of the central research topics in enumerative topological graph theory. A covering projection p from a Cayley graph Cay(Γ, X) onto another Cayley graph Cay(Q, Y) is called typical if the function p : Γ → Q on the vertex sets is a group epimorphism. A typical covering is called abelian (or circulant, respectively) if its covering graph is a Cayley graph on an abelian (or a cyclic, respectively) group. Recently, the equivalence classes of connected abelian typical prime-fold coverings of a circulant graph are enumerated. As a continuation of this work, we enumerate the equivalence classes of connected abelian typical cube-free fold coverings of a circulant graph.
APA, Harvard, Vancouver, ISO, and other styles
7

Wang, Shiping, Qingxin Zhu, William Zhu, and Fan Min. "Equivalent Characterizations of Some Graph Problems by Covering-Based Rough Sets." Journal of Applied Mathematics 2013 (2013): 1–7. http://dx.doi.org/10.1155/2013/519173.

Full text
Abstract:
Covering is a widely used form of data structures. Covering-based rough set theory provides a systematic approach to this data. In this paper, graphs are connected with covering-based rough sets. Specifically, we convert some important concepts in graph theory including vertex covers, independent sets, edge covers, and matchings to ones in covering-based rough sets. At the same time, corresponding problems in graphs are also transformed into ones in covering-based rough sets. For example, finding a minimal edge cover of a graph is translated into finding a minimal general reduct of a covering. The main contributions of this paper are threefold. First, any graph is converted to a covering. Two graphs induce the same covering if and only if they are isomorphic. Second, some new concepts are defined in covering-based rough sets to correspond with ones in graph theory. The upper approximation number is essential to describe these concepts. Finally, from a new viewpoint of covering-based rough sets, the general reduct is defined, and its equivalent characterization for the edge cover is presented. These results show the potential for the connection between covering-based rough sets and graphs.
APA, Harvard, Vancouver, ISO, and other styles
8

Ma, Jicheng. "On 3-arc-transitive covers of the dodecahedron graph." Filomat 30, no. 13 (2016): 3493–99. http://dx.doi.org/10.2298/fil1613493m.

Full text
Abstract:
In this paper, the following problem is considered: does there exist a t-arc-transitive regular covering graph of an s-arc-transitive graph for positive integers t greater than s? In order to answer this question, we classify all arc-transitive cyclic regular covers of the dodecahedron graph. Two infinite families of 3-arc-transitive abelian covering graphs are given, which give more specific examples that for an s-arc-transitive graph there exist (s+1)-arc-transitive covering graphs.
APA, Harvard, Vancouver, ISO, and other styles
9

Sohn, Moo Young, and Jaeun Lee. "Characteristic polynomials of some weighted graph bundles and its application to links." International Journal of Mathematics and Mathematical Sciences 17, no. 3 (1994): 503–10. http://dx.doi.org/10.1155/s0161171294000748.

Full text
Abstract:
In this paper, we introduce weighted graph bundles and study their characteristic polynomial. In particular, we show that the characteristic polynomial of a weightedK2(K¯2)-bundles over a weighted graphG?can be expressed as a product of characteristic polynomials two weighted graphs whose underlying graphs areGAs an application, we compute the signature of a link whose corresponding weighted graph is a double covering of that of a given link.
APA, Harvard, Vancouver, ISO, and other styles
10

Vasanthi, R., and K. Subramanian. "On Vertex Covering Transversal Domination Number of Regular Graphs." Scientific World Journal 2016 (2016): 1–7. http://dx.doi.org/10.1155/2016/1029024.

Full text
Abstract:
A simple graphG=(V,E)is said to ber-regular if each vertex ofGis of degreer. The vertex covering transversal domination numberγvct(G)is the minimum cardinality among all vertex covering transversal dominating sets ofG. In this paper, we analyse this parameter on different kinds of regular graphs especially forQnandH3,n. Also we provide an upper bound forγvctof a connected cubic graph of ordern≥8. Then we try to provide a more stronger relationship betweenγandγvct.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Graph covering"

1

Bryant, Roy Dale. "Covering the de Bruijn graph." Thesis, Monterey, California. Naval Postgraduate School, 1986. http://hdl.handle.net/10945/21751.

Full text
Abstract:
Random-like sequences of 0's and l's are generated efficiently by binary shift registers. The output of n-stage shift registers viewed as a sequence of binary n-tuples also give rise to a special graph called the de Bruijn graph B . The de Bruijn graph is a directed graph with 2n nodes. Each node has 2 arcs entering it and 2 arcs going out of it. Thus, there are a total of 2n+1 arcs in Bn. In this thesis, we define a cover of the de Bruijn graph, different from the usual graph theoretic cover. A cover S of the de Bruijn graph is defined as an independent subset of the nodes of Bn that satisfy the following J property. For each node x in Bn - S, there exists a node y in S such that either the arc or the arc is in Bn. Combinatorially, we are able to place both upper and lower bounds on the cardinality of S. We find examples of covers that approach these bounds in cardinality. Several algorithms are presented that produce either a maximal or a minimal cover. Among them are Frugal, Sequential Fill, Double and Redouble, Greedy and Quartering.
APA, Harvard, Vancouver, ISO, and other styles
2

Maltais, Elizabeth Jane. "Graph-dependent Covering Arrays and LYM Inequalities." Thesis, Université d'Ottawa / University of Ottawa, 2016. http://hdl.handle.net/10393/34434.

Full text
Abstract:
The problems we study in this thesis are all related to covering arrays. Covering arrays are combinatorial designs, widely used as templates for efficient interaction-testing suites. They have connections to many areas including extremal set theory, design theory, and graph theory. We define and study several generalizations of covering arrays, and we develop a method which produces an infinite family of LYM inequalities for graph-intersecting collections. A common theme throughout is the dependence of these problems on graphs. Our main contribution is an extremal method yielding LYM inequalities for $H$-intersecting collections, for every undirected graph $H$. Briefly, an $H$-intersecting collection is a collection of packings (or partitions) of an $n$-set in which the classes of every two distinct packings in the collection intersect according to the edges of $H$. We define ``$F$-following" collections which, by definition, satisfy a LYM-like inequality that depends on the arcs of a ``follow" digraph $F$ and a permutation-counting technique. We fully characterize the correspondence between ``$F$-following" and ``$H$-intersecting" collections. This enables us to apply our inequalities to $H$-intersecting collections. For each graph $H$, the corresponding inequality inherently bounds the maximum number of columns in a covering array with alphabet graph $H$. We use this feature to derive bounds for covering arrays with the alphabet graphs $S_3$ (the star on three vertices) and $\kvloop{3}$ ($K_3$ with loops). The latter improves a known bound for classical covering arrays of strength two. We define covering arrays on column graphs and alphabet graphs which generalize covering arrays on graphs. The column graph encodes which pairs of columns must be $H$-intersecting, where $H$ is a given alphabet graph. Optimizing covering arrays on column graphs and alphabet graphs is equivalent to a graph-homomorphism problem to a suitable family of targets which generalize qualitative independence graphs. When $H$ is the two-vertex tournament, we give constructions and bounds for covering arrays on directed column graphs. FOR arrays are the broadest generalization of covering arrays that we consider. We define FOR arrays to encompass testing applications where constraints must be considered, leading to forbidden, optional, and required interactions of any strength. We model these testing problems using a hypergraph. We investigate the existence of FOR arrays, the compatibility of their required interactions, critical systems, and binary relational systems that model the problem using homomorphisms.
APA, Harvard, Vancouver, ISO, and other styles
3

Minei, Marvin. "Three block diagonalization methods for the finite Cayley and covering graph /." Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 2000. http://wwwlib.umi.com/cr/ucsd/fullcit?p9974107.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Tanaka, Ryokichi. "Large deviation on a covering graph with group of polynomial growth." 京都大学 (Kyoto University), 2012. http://hdl.handle.net/2433/152534.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Yu, Nuo 1983. "Fixed parameter tractable algorithms for optimal covering tours with turns." Thesis, McGill University, 2008. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=111595.

Full text
Abstract:
Many geometry problems can be solved by transformation to graph problems. Often, both the geometry version and graph version of the problem are NP-hard - and therefore not likely to be solved in polynomial time. One approach to solving these hard problems is to use fixed parameter tractable (FPT) algorithms. We present a framework for developing FPT algorithms for graph problems using dynamic programming, monadic second order logic of graphs, tree-width, and bidimensionality. We use this framework to obtain FPT results for covering tour problems on grid-graphs with turn costs. The results for these problems are not practical, but they demonstrate how the basic framework can be used to quickly obtain FPT results. We provide suggestions on further research to improve our FPT results and to apply our framework to obtain new FPT results.
APA, Harvard, Vancouver, ISO, and other styles
6

許眞眞 and Zhenzhen Xu. "A min-max theorem on packing and covering cycles in graphs." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2002. http://hub.hku.hk/bib/B31226966.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Xu, Zhenzhen. "A min-max theorem on packing and covering cycles in graphs /." Hong Kong : University of Hong Kong, 2002. http://sunzi.lib.hku.hk/hkuto/record.jsp?B25155301.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Gibbins, Aliska L. "Automorphism Groups of Buildings Constructed Via Covering Spaces." The Ohio State University, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=osu1373976456.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Levy, Eythan. "Approximation algorithms for covering problems in dense graphs." Doctoral thesis, Universite Libre de Bruxelles, 2009. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/210359.

Full text
Abstract:
We present a set of approximation results for several covering problems in dense graphs. These results show that for several problems, classical algorithms with constant approximation ratios can be analyzed in a finer way, and provide better constant approximation ratios under some density constraints. In particular, we show that the maximal matching heuristic approximates VERTEX COVER (VC) and MINIMUM MAXIMAL MATCHING (MMM) with a constant ratio strictly smaller than 2 when the proportion of edges present in the graph (weak density) is at least 3/4, or when the normalized minimum degree (strong density) is at least 1/2. We also show that this result can be improved by a greedy algorithm which provides a constant ratio smaller than 2 when the weak density is at least 1/2. We also provide tight families of graphs for all these approximation ratios. We then looked at several algorithms from the literature for VC and SET COVER (SC). We present a unified and critical approach to the Karpinski/Zelikovsky, Imamura/Iwama and Bar-Yehuda/Kehat algorithms, identifying the general the general scheme underlying these algorithms.

Finally, we look at the CONNECTED VERTEX COVER (CVC) problem,for which we proposed new approximation results in dense graphs. We first analyze Carla Savage's algorithm, then a new variant of the Karpinski-Zelikovsky algorithm. Our results show that these algorithms provide the same approximation ratios for CVC as the maximal matching heuristic and the Karpinski-Zelikovsky algorithm did for VC. We provide tight examples for the ratios guaranteed by both algorithms. We also introduce a new invariant, the "price of connectivity of VC", defined as the ratio between the optimal solutions of CVC and VC, and showed a nearly tight upper bound on its value as a function of the weak density. Our last chapter discusses software aspects, and presents the use of the GRAPHEDRON software in the framework of approximation algorithms, as well as our contributions to the development of this system.

/

Nous présentons un ensemble de résultats d'approximation pour plusieurs problèmes de couverture dans les graphes denses. Ces résultats montrent que pour plusieurs problèmes, des algorithmes classiques à facteur d'approximation constant peuvent être analysés de manière plus fine, et garantissent de meilleurs facteurs d'aproximation constants sous certaines contraintes de densité. Nous montrons en particulier que l'heuristique du matching maximal approxime les problèmes VERTEX COVER (VC) et MINIMUM MAXIMAL MATCHING (MMM) avec un facteur constant inférieur à 2 quand la proportion d'arêtes présentes dans le graphe (densité faible) est supérieure à 3/4 ou quand le degré minimum normalisé (densité forte) est supérieur à 1/2. Nous montrons également que ce résultat peut être amélioré par un algorithme de type GREEDY, qui fournit un facteur constant inférieur à 2 pour des densités faibles supérieures à 1/2. Nous donnons également des familles de graphes extrémaux pour nos facteurs d'approximation. Nous nous somme ensuite intéressés à plusieurs algorithmes de la littérature pour les problèmes VC et SET COVER (SC). Nous avons présenté une approche unifiée et critique des algorithmes de Karpinski-Zelikovsky, Imamura-Iwama, et Bar-Yehuda-Kehat, identifiant un schéma général dans lequel s'intègrent ces algorithmes.

Nous nous sommes finalement intéressés au problème CONNECTED VERTEX COVER (CVC), pour lequel nous avons proposé de nouveaux résultats d'approximation dans les graphes denses, au travers de l'algorithme de Carla Savage d'une part, et d'une nouvelle variante de l'algorithme de Karpinski-Zelikovsky d'autre part. Ces résultats montrent que nous pouvons obtenir pour CVC les mêmes facteurs d'approximation que ceux obtenus pour VC à l'aide de l'heuristique du matching maximal et de l'algorithme de Karpinski-Zelikovsky. Nous montrons également des familles de graphes extrémaux pour les ratios garantis par ces deux algorithmes. Nous avons également étudié un nouvel invariant, le coût de connectivité de VC, défini comme le rapport entre les solutions optimales de CVC et de VC, et montré une borne supérieure sur sa valeur en fonction de la densité faible. Notre dernier chapitre discute d'aspects logiciels, et présente l'utilisation du logiciel GRAPHEDRON dans le cadre des algorithmes d'approximation, ainsi que nos contributions au développement du logiciel.
Doctorat en Sciences
info:eu-repo/semantics/nonPublished

APA, Harvard, Vancouver, ISO, and other styles
10

El-Darzi, E. "Methods for solving the set covering and set partitioning problems using graph theoretic (relaxation) algorithms." Thesis, Brunel University, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.381678.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Graph covering"

1

El-Darzi, Elia. Methods for solving the set covering and set partitioning problems using graph theoretic (relaxation) algorithms. Uxbridge: Brunel University, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Fujie, Futaba, and Ping Zhang. Covering Walks in Graphs. New York, NY: Springer New York, 2014. http://dx.doi.org/10.1007/978-1-4939-0305-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Barg, Alexander, and O. R. Musin. Discrete geometry and algebraic combinatorics. Providence, Rhode Island: American Mathematical Society, 2014.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Zhang, Ping, and Futaba Fujie. Covering Walks in Graphs. Springer, 2014.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Bryant, Roy Dale. Covering the de BRUIJN graph. 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Wilson, Robin. Combinatorics: A Very Short Introduction. Oxford University Press, 2016. http://dx.doi.org/10.1093/actrade/9780198723493.001.0001.

Full text
Abstract:
Combinatorics is the branch of mathematics concerned with selecting, arranging, and listing or counting collections of objects. Dating back some 3000 years, and initially consisting mainly of the study of permutations and combinations, its scope has broadened to include topics such as graph theory, partitions of numbers, block designs, design of codes, and latin squares. Combinatorics: A Very Short Introduction provides an overview of the field and its applications in mathematics and computer theory, considering problems from the shortest routes covering certain stops to the minimum number of colours needed to draw a map with different colours for neighbouring countries.
APA, Harvard, Vancouver, ISO, and other styles
7

Instruction, Inc Video Aided. GED Math Review: An Intensive Review Course Covering Arithmetic, Charts & Graphs, Probability & Statistics, Algebra, Geometry, 1VHS, 2 Hours. Video Aided Instruction, Inc., 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Graph covering"

1

Hjort Blindell, Gabriel. "Graph Covering." In Instruction Selection, 105–19. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-34019-7_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Diestel, Reinhard. "Matching Covering and Packing." In Graph Theory, 35–57. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/978-3-642-14279-6_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Diestel, Reinhard. "Matching Covering and Packing." In Graph Theory, 35–58. Berlin, Heidelberg: Springer Berlin Heidelberg, 2017. http://dx.doi.org/10.1007/978-3-662-53622-3_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Vernadat, François, Pierre Azéma, and François Michel. "Covering step graph." In Application and Theory of Petri Nets 1996, 516–35. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61363-3_28.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Rahman, Md Saidur. "Matching and Covering." In Basic Graph Theory, 63–75. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-49475-3_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Dumitrescu, Adrian, and Csaba D. Tóth. "Covering Paths for Planar Point Sets." In Graph Drawing, 303–14. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-36763-2_27.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Zhu, Binhai, and Xiaotie Deng. "On Computing and Drawing Maxmin-Height Covering Triangulation." In Graph Drawing, 464–66. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/3-540-37623-2_48.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Kratochvíl, Jan, Andrzej Proskurowski, and Jan Arne Telle. "Complexity of graph covering problems." In Graph-Theoretic Concepts in Computer Science, 93–105. Berlin, Heidelberg: Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/3-540-59071-4_40.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Torim, Ants, Marko Mets, and Kristo Raun. "Covering Concept Lattices with Concept Chains." In Graph-Based Representation and Reasoning, 190–203. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-23182-8_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Vernadat, François, and François Michel. "Covering step graph preserving failure semantics." In Application and Theory of Petri Nets 1997, 253–70. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/3-540-63139-9_40.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Graph covering"

1

Dinneen, Michael J., and Richard Hua. "Formulating graph covering problems for adiabatic quantum computers." In ACSW 2017: Australasian Computer Science Week 2017. New York, NY, USA: ACM, 2017. http://dx.doi.org/10.1145/3014812.3014830.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Indumathi, R. S., M. R. Rajesh Kanna, and S. Roopa. "Minimum covering q-distance energy of a graph." In PROCEEDINGS OF INTERNATIONAL CONFERENCE ON ADVANCES IN MATERIALS RESEARCH (ICAMR - 2019). AIP Publishing, 2020. http://dx.doi.org/10.1063/5.0016782.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kumar, R. Pradeep, and M. R. Rajesh Kanna. "Minimum covering color Laplacian energy of a graph." In PROCEEDINGS OF INTERNATIONAL CONFERENCE ON ADVANCES IN MATERIALS RESEARCH (ICAMR - 2019). AIP Publishing, 2020. http://dx.doi.org/10.1063/5.0016786.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Han, Muhua, Leibo Liu, and Shaojun Wei. "A graph covering method for template based system partition." In 2008 International Conference on Communications, Circuits and Systems (ICCCAS). IEEE, 2008. http://dx.doi.org/10.1109/icccas.2008.4658022.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Yazdanbakhsh, Amir, Mostafa E. Salehi, and Sied Mehdi Fakhraie. "Architecture-Aware Graph-Covering Algorithm for Custom Instruction Selection." In 2010 5th International Conference on Future Information Technology. IEEE, 2010. http://dx.doi.org/10.1109/futuretech.2010.5482719.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Dörpinghaus, Jens, Sebastian Schaaf, Juliane Fluck, and Marc Jacobs. "Document Clustering using a Graph Covering with Pseudostable Sets." In 2017 Federated Conference on Computer Science and Information Systems. IEEE, 2017. http://dx.doi.org/10.15439/2017f84.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Guo, Yuanqing, Gerard J. M. Smit, Hajo Broersma, and Paul M. Heysters. "A graph covering algorithm for a coarse grain reconfigurable system." In the 2003 ACM SIGPLAN conference. New York, New York, USA: ACM Press, 2003. http://dx.doi.org/10.1145/780732.780760.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Motwani, R., A. Raghunathan, and H. Saran. "Covering orthogonal polygons with star polygons: the perfect graph approach." In the fourth annual symposium. New York, New York, USA: ACM Press, 1988. http://dx.doi.org/10.1145/73393.73415.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Martini, T. S., M. Roswitha, and D. A. Lestari. "Cycle-supermagic covering on grid graph and K1,n+K¯2." In PROCEEDINGS OF THE 3RD INTERNATIONAL SYMPOSIUM ON CURRENT PROGRESS IN MATHEMATICS AND SCIENCES 2017 (ISCPMS2017). Author(s), 2018. http://dx.doi.org/10.1063/1.5064194.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Bernáth, Attila, Roland Grappe, and Zoltán Szigeti. "Partition constrained covering of a symmetric crossing supermodular function by a graph." In Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2010. http://dx.doi.org/10.1137/1.9781611973075.123.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Graph covering' for particular source types:
Journal articles Dissertations / Theses
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography