Log in

Relevant bibliographies by topics / Cover graph

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Cover graph'

Author: Grafiati

Published: 6 June 2025

Last updated: 25 July 2025

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 'Cover graph.'

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 "Cover graph"

1

Arumugam, S., Indra Rajasingh, and P. Roushini Leely Pushpam. "Characterization of a class of graphs with unique minimum graphoidal cover." Tamkang Journal of Mathematics 34, no. 4 (2003): 317–26. http://dx.doi.org/10.5556/j.tkjm.34.2003.234.

Full text

Abstract:

A graphoidal cover of a graph $ G$ is a collection $ \psi$ of (not necessarily open) paths in $ G$ such that every vertex of $ G$ is an internal vertex of at most one path in $ \psi$ and every edge of $ G$ is in exactly one path in $ \psi$. The minimum cardinality of a graphoidal cover of $ G$ is called the graphoidal covering number of $ G$ and is denoted by $ \eta$ . Two graphoidal covers $ \psi_1$ and $ \psi_2$ of a graph $ G$ are said to be isomorphic if there exists an automorphism $ f$ of $ G$ such that $ \psi_2=\{f(P)/P\in \psi_1\}$. A graph $ G$ is said to have a unique minimum graphoi

APA, Harvard, Vancouver, ISO, and other styles

2

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.

APA, Harvard, Vancouver, ISO, and other styles

3

Tsiovkina, Ludmila Yu. "ON A CLASS OF EDGE-TRANSITIVE DISTANCE-REGULAR ANTIPODAL COVERS OF COMPLETE GRAPHS." Ural Mathematical Journal 7, no. 2 (2021): 136. http://dx.doi.org/10.15826/umj.2021.2.010.

Full text

Abstract:

The paper is devoted to the problem of classification of edge-transitive distance-regular antipodal covers of complete graphs. This extends the classification of those covers that are arc-transitive, which has been settled except for some tricky cases that remain to be considered, including the case of covers satisfying condition \(c_2=1\) (which means that every two vertices at distance 2 have exactly one common neighbour).Here it is shown that an edge-transitive distance-regular antipodal cover of a complete graph with \(c_2=1\) is either the second neighbourhood of a vertex in a Moore graph

APA, Harvard, Vancouver, ISO, and other styles

4

Bilar, Vergel, Maria Andrea Bonsocan, Javier Hassan, and Susan Dagondon. "Vertex Cover Hop Dominating Sets in Graphs." European Journal of Pure and Applied Mathematics 17, no. 1 (2024): 93–104. http://dx.doi.org/10.29020/nybg.ejpam.v17i1.4978.

Full text

Abstract:

Let $G$ be a graph. Then a subset $C$ of vertices of $G$ is called a vertex cover hop dominating if $C$ is both a vertex cover and a hop dominating of $G$. The vertex cover hop domination number of $G$, denoted by $\gamma_{vch}(G)$, is the minimum cardinality among all vertex cover hop dominating sets in $G$. In this paper, we initiate the study of vertex cover hop domination in a graph and we determine its relations with other parameters in graph theory. We characterize the vertex cover hop dominating sets in some special graphs, join, and corona of two graphs and we finally obtain the exact

APA, Harvard, Vancouver, ISO, and other styles

5

Scaria, Deena C., John Joy Mulloor, Liju Alex, and Gopal Indulal. "A note on some graph parameters and graph operations." Open Journal of Discrete Applied Mathematics 8, no. 2 (2025): 32–44. https://doi.org/10.30538/psrp-odam2025.0114.

Full text

Abstract:

This paper introduces the concept of the extended \(H\)-cover of a graph \(G\), denoted as \(G^*_H\) , as a generalization inspired by the extended double cover graphs discussed in Chen [1]. We explore the spectral properties and energy characteristics of \(G^*_H\), deriving formulae for the number of spanning trees in cases where both \(G\) and \(H\) are regular. Our investigation identifies several infinite families of equienergetic graphs and highlights instances of cospectral graphs within \(G^*_H\) . Additionally, we analyze various graph parameters related to the Indu-Bala product of gra

APA, Harvard, Vancouver, ISO, and other styles

6

Priscilla, Paul, and Syed Ali Fathima S. "A Study on Edge Pebbling Number, Covering Cover Edge Pebbling Number of Friendship Graphs, Odd Path and Even Path." Indian Journal of Science and Technology 16, no. 32 (2023): 2480–84. https://doi.org/10.17485/IJST/v16i32.674.

Full text

Abstract:

Abstract <strong>Objectives:</strong> To find the edge pebbling number and covering cover edge pebbling number of friendship graphs.<strong> Methods:</strong> The possible minimum edge covering set of the friendship graph is considered and the set with the minimum pebble requirement covering all vertices is selected. <strong>Findings:</strong> Obtained the modified result of edge pebbling number of friendship graph, defined the covering cover edge pebbling number of a graph G, and covering cover edge pebbling number for friendship graphs, odd path and even path is foun

APA, Harvard, Vancouver, ISO, and other styles

7

ZHOU, JIN-XIN, and YAN-QUAN FENG. "TETRAVALENT s-TRANSITIVE GRAPHS OF ORDER TWICE A PRIME POWER." Journal of the Australian Mathematical Society 88, no. 2 (2010): 277–88. http://dx.doi.org/10.1017/s1446788710000066.

Full text

Abstract:

AbstractA graph is s-transitive if its automorphism group acts transitively on s-arcs but not on (s+1)-arcs in the graph. Let X be a connected tetravalent s-transitive graph of order twice a prime power. In this paper it is shown that s=1,2,3 or 4. Furthermore, if s=2, then X is a normal cover of one of the following graphs: the 4-cube, the complete graph of order 5, the complete bipartite graph K5,5 minus a 1-factor, or K7,7 minus a point-hyperplane incidence graph of the three-dimensional projective geometry PG(2,2); if s=3, then X is a normal cover of the complete bipartite graph of order 4

APA, Harvard, Vancouver, ISO, and other styles

8

Alikhani, Saeid. "Graphs Whose Certain Polynomials Have Few Distinct Roots." ISRN Discrete Mathematics 2013 (September 12, 2013): 1–8. http://dx.doi.org/10.1155/2013/195818.

Full text

Abstract:

Let G=(V,E) be a simple graph. Graph polynomials are a well-developed area useful for analyzing properties of graphs. We consider domination polynomial, matching polynomial, and edge cover polynomial of G. Graphs which their polynomials have few roots can sometimes give surprising information about the structure of the graph. This paper is primarily a survey of graphs whose domination polynomial, matching polynomial, and edge cover polynomial have few distinct roots. In addition, some new unpublished results and questions are concluded.

APA, Harvard, Vancouver, ISO, and other styles

9

Liu, Zhi-Qiang, Ping Tang, Weixiong Zhang, and Zheng Zhang. "CNN-Enhanced Heterogeneous Graph Convolutional Network: Inferring Land Use from Land Cover with a Case Study of Park Segmentation." Remote Sensing 14, no. 19 (2022): 5027. http://dx.doi.org/10.3390/rs14195027.

Full text

Abstract:

Land use segmentation is a fundamental yet challenging task in remote sensing. Most current methods mainly take images as input and sometimes cannot achieve satisfactory results due to limited information. Inspired by the inherent relations between land cover and land use, we investigate land use segmentation using additional land cover data. The topological relations among land cover objects are beneficial for bridging the semantic gap between land cover and land use. Specifically, these relations are usually depicted by a geo-object-based graph structure. Deep convolutional neural networks (

APA, Harvard, Vancouver, ISO, and other styles

10

Domagalski, Rachel, and Sivaram Narayan. "Tree Cover Number and Maximum Semidefinite Nullity of Some Graph Classes." Electronic Journal of Linear Algebra 36, no. 36 (2020): 678–93. http://dx.doi.org/10.13001/ela.2020.5319.

Full text

Abstract:

Let $G$ be a graph with a vertex set $V$ and an edge set $E$ consisting of unordered pairs of vertices. The tree cover number of $G$, denoted $\tau(G)$, is the minimum number of vertex disjoint simple trees occurring as induced subgraphs of $G$ that cover all the vertices of $G$. In this paper, the tree cover number of a line graph $\tau(L(G))$ is shown to be equal to the path number $\pi(G)$ of $G$. Also, the tree cover numbers of shadow graphs, corona and Cartesian product of two graphs are found. The graph parameter $\tau(G)$ is related to another graph parameter $M_+(G)$, called the

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "Cover graph"

1

Meek, Darrin Leigh. "On graph approximation heuristics : an application to vertex cover on planar graphs." Thesis, Georgia Institute of Technology, 1991. http://hdl.handle.net/1853/24088.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Abdullah, Mohammed. "The cover time of random walks on graph." Thesis, King's College London (University of London), 2012. https://kclpure.kcl.ac.uk/portal/en/theses/the-cover-time-of-random-walks-on-graph(c23c303f-a6a2-4489-a059-4ade7c118106).html.

Full text

Abstract:

A simple random walk on a graph is a sequence of movements from one vertex to another where at each step an edge is chosen uniformly at random from the set of edges incident on the current vertex, and then transitioned to next vertex. Central to this thesis is the cover time of the walk, that is, the expectation of the number of steps required to visit every vertex, maximised over all starting vertices. In our rst contribution, we establish a relation between the cover times of a pair of graphs, and the cover time of their Cartesian product. This extends previous work on special cases of the C

APA, Harvard, Vancouver, ISO, and other styles

3

Streib, Noah Sametz. "Planar and hamiltonian cover graphs." Diss., Georgia Institute of Technology, 2011. http://hdl.handle.net/1853/43744.

Full text

Abstract:

This dissertation has two principal components: the dimension of posets with planar cover graphs, and the cartesian product of posets whose cover graphs have hamiltonian cycles that parse into symmetric chains. Posets of height two can have arbitrarily large dimension. In 1981, Kelly provided an infinite sequence of planar posets that shows that the dimension of planar posets can also be arbitrarily large. However, the height of the posets in this sequence increases with the dimension. In 2009, Felsner, Li, and Trotter conjectured that for each integer h at least 2, there exists a least po

APA, Harvard, Vancouver, ISO, and other styles

4

Carney, Nicholas. "Roman Domination Cover Rubbling." Digital Commons @ East Tennessee State University, 2019. https://dc.etsu.edu/etd/3617.

Full text

Abstract:

In this thesis, we introduce Roman domination cover rubbling as an extension of domination cover rubbling. We define a parameter on a graph $G$ called the \textit{Roman domination cover rubbling number}, denoted $\rho_{R}(G)$, as the smallest number of pebbles, so that from any initial configuration of those pebbles on $G$, it is possible to obtain a configuration which is Roman dominating after some sequence of pebbling and rubbling moves. We begin by characterizing graphs $G$ having small $\rho_{R}(G)$ value. Among other things, we also obtain the Roman domination cover rubbling number for p

APA, Harvard, Vancouver, ISO, and other styles

5

Sinkovic, John Henry. "The Minimum Rank Problem for Outerplanar Graphs." BYU ScholarsArchive, 2013. https://scholarsarchive.byu.edu/etd/3722.

Full text

Abstract:

Given a simple graph G with vertex set V(G)={1,2,...,n} define S(G) to be the set of all real symmetric matrices A such that for all i not equal to j, the ijth entry of A is nonzero if and only if ij is in E(G). The range of the ranks of matrices in S(G) is of interest and can be determined by finding the minimum rank. The minimum rank of a graph, denoted mr(G), is the minimum rank achieved by a matrix in S(G). The maximum nullity of a graph, denoted M(G), is the maximum nullity achieved by a matrix in S(G). Note that mr(G)+M(G)=|V(G)| and so in finding the maximum nullity of a graph, the mini

APA, Harvard, Vancouver, ISO, and other styles

6

Hassan-Shafique, Khurram. "PARTITIONING A GRAPH IN ALLIANCES AND ITS APPLICATION TO DATA CLUSTERING." Doctoral diss., University of Central Florida, 2004. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/4152.

Full text

Abstract:

Any reasonably large group of individuals, families, states, and parties exhibits the phenomenon of subgroup formations within the group such that the members of each group have a strong connection or bonding between each other. The reasons of the formation of these subgroups that we call alliances differ in different situations, such as, kinship and friendship (in the case of individuals), common economic interests (for both individuals and states), common political interests, and geographical proximity. This structure of alliances is not only prevalent in social networks, but it is also an i

APA, Harvard, Vancouver, ISO, and other styles

7

Cornet, Alexis. "Algorithmes et résultats de complexité pour des problèmes de graphes avec contraintes additionnelles." Thesis, Université Clermont Auvergne‎ (2017-2020), 2018. http://www.theses.fr/2018CLFAC034/document.

Full text

Abstract:

Les problèmes de domination (dominant, dominant indépendant, ...) et de couverture (vertex-cover, arbre de Steiner, ...) sont NP-complets. Pour autant, pour la plupart de ces problèmes, il existe toujours une solution constructible en temps polynomial (potentiellement de valeur objective très mauvaise), ou au moins, il est possible de déterminer facilement (en temps polynomial) l'existence ou non d'une solution. Ces problèmes, initialement issus de situations réelles, sont des modélisations simplistes de ces situations. Nous ajoutons donc des contraintes additionnelles modélisant des contraint

APA, Harvard, Vancouver, ISO, and other styles

8

Oosthuizen, Joubert. "Random walks on graphs." Thesis, Stellenbosch : Stellenbosch University, 2014. http://hdl.handle.net/10019.1/86244.

Full text

Abstract:

Thesis (MSc)--Stellenbosch University, 2014.<br>ENGLISH ABSTRACT: We study random walks on nite graphs. The reader is introduced to general Markov chains before we move on more specifically to random walks on graphs. A random walk on a graph is just a Markov chain that is time-reversible. The main parameters we study are the hitting time, commute time and cover time. We nd novel formulas for the cover time of the subdivided star graph and broom graph before looking at the trees with extremal cover times. Lastly we look at a connection between random walks on graphs and electrical netw

APA, Harvard, Vancouver, ISO, and other styles

9

Camby, Eglantine. "Connecting hitting sets and hitting paths in graphs." Doctoral thesis, Universite Libre de Bruxelles, 2015. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/209048.

Full text

Abstract:

Dans cette thèse, nous étudions les aspects structurels et algorithmiques de différents problèmes de théorie des graphes. Rappelons qu’un graphe est un ensemble de sommets éventuellement reliés par des arêtes. Deux sommets sont adjacents s’ils sont reliés par une arête.<p>Tout d’abord, nous considérons les deux problèmes suivants :le problème de vertex cover et celui de dominating set, deux cas particuliers du problème de hitting set. Un vertex cover est un ensemble de sommets qui rencontrent toutes les arêtes alors qu’un dominating set est un ensemble X de sommets tel que chaque sommet n’appa

APA, Harvard, Vancouver, ISO, and other styles

10

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 (stro

APA, Harvard, Vancouver, ISO, and other styles

More sources

Books on the topic "Cover graph"

1

Graph Paper, Viridian Cover. Independently Published, 2021.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

NoteBooks, Sappuris. Graph Paper, Magenta Cover. Independently Published, 2021.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Graph Paper Aua Blue Cover. Independently Published, 2021.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

Sappuris Graph Paper, Orchid Cover. Independently Published, 2021.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Press, Mockup. Graph Notebook: Hardcover Graph Notebook with Retro Style Cover. Independently Published, 2021.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Publishing, Karabella. Graph Paper: 5x5 Blank Graph Paper with Angel on Cover. Independently Published, 2018.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

Magic, Handwriter. Graph Paper Notebook: Beautiful Soft Cover. Independently Published, 2020.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

NoteBooks, Sappuris. Graph Paper Abstract Halftone Background Cover. Independently Published, 2021.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

Sunny Days Sunny Days School Room. Graph Paper Notepad: 5x5 Graph Ruled Squared Graphing Paper with Coordinate Graph Point Cover. Independently Published, 2019.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

books, touchich. Graph Paper Composition 5x5: Size 6*9,120 Graph Pages ,matte Cover. Independently Published, 2020.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Book chapters on the topic "Cover graph"

1

Atienza, Nieves, Natalia de Castro, Carmen Cortés, et al. "Cover Contact Graphs." In Graph Drawing. Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-77537-9_18.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Angel, Eric, Evripidis Bampis, Bruno Escoffier, and Michael Lampis. "Parameterized Power Vertex Cover." In Graph-Theoretic Concepts in Computer Science. Springer Berlin Heidelberg, 2016. http://dx.doi.org/10.1007/978-3-662-53536-3_9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Fomin, Fedor V., and Torstein J. F. Strømme. "Vertex Cover Structural Parameterization Revisited." In Graph-Theoretic Concepts in Computer Science. Springer Berlin Heidelberg, 2016. http://dx.doi.org/10.1007/978-3-662-53536-3_15.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Kourie, Derrick G., and Bruce W. Watson. "Case Study: Lattice Cover Graph Construction." In The Correctness-by-Construction Approach to Programming. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-27919-5_6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Ivković, Zoran, and Errol L. Lloyd. "Fully dynamic maintenance of vertex cover." In Graph-Theoretic Concepts in Computer Science. Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/3-540-57899-4_44.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Wang, Liang, and Jianxin Zhao. "Computation Graph." In Architecture of Advanced Numerical Analysis Systems. Apress, 2022. http://dx.doi.org/10.1007/978-1-4842-8853-5_6.

Full text

Abstract:

AbstractA computation graph is a basic theoretical tool that underlines modern deep learning libraries. It is also an important component in Owl. This chapter first gives a bird’s-eye view on the computation graph in Owl and its importance in computing. We then demonstrate how to use it in Owl with some examples. Then we will continue to cover the design and implementation details of the computation graph module and how it is fitted into Owl’s functor stack.

APA, Harvard, Vancouver, ISO, and other styles

7

Kneis, Joachim, Alexander Langer, and Peter Rossmanith. "Improved Upper Bounds for Partial Vertex Cover." In Graph-Theoretic Concepts in Computer Science. Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-92248-3_22.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Chen, Jianer, Iyad A. Kanj, and Weijia Jia. "Vertex Cover: Further Observations and Further Improvements." In Graph-Theoretic Concepts in Computer Science. Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-46784-x_30.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Kılıç, Baran, Can Özturan, and Alper Şen. "Analyzing Large-Scale Blockchain Transaction Graphs for Fraudulent Activities." In Big Data and Artificial Intelligence in Digital Finance. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-94590-9_14.

Full text

Abstract:

AbstractEarly public blockchains provided low transaction throughputs in the range of 7–30 transactions per second. With the emergence of permissioned and proof-of-stake-based blockchains, transaction throughputs are expected to rise drastically to thousands per second. Blockchain transactions form directed graphs. With high transaction throughputs and growing blockchain adoption by banks, businesses and customers in general, the number of edges in transaction graphs will dynamically grow to billions. An analysis of large-scale transaction graphs is needed for tracing fraudulent activities on

APA, Harvard, Vancouver, ISO, and other styles

10

Fellows, Michael R., Daniel Lokshtanov, Neeldhara Misra, Frances A. Rosamond, and Saket Saurabh. "Graph Layout Problems Parameterized by Vertex Cover." In Algorithms and Computation. Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-92182-0_28.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Cover graph"

1

Guan, Renxiang, Zihao Li, Chujia Song, Guo Yu, Xianju Li, and Ruyi Feng. "S²RC-GCN: A Spatial-Spectral Reliable Contrastive Graph Convolutional Network for Complex Land Cover Classification Using Hyperspectral Images." In 2024 International Joint Conference on Neural Networks (IJCNN). IEEE, 2024. http://dx.doi.org/10.1109/ijcnn60899.2024.10650629.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Krishnan, Sivaram, Jihong Park, Gregory Sherman, Benjamin Campbell, and Jinho Choi. "Graph Koopman Autoencoder for Predictive Covert Communication Against UAV Surveillance." In 2024 IEEE 99th Vehicular Technology Conference (VTC2024-Spring). IEEE, 2024. http://dx.doi.org/10.1109/vtc2024-spring62846.2024.10683140.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Stephans, Larry C. "The Design of Masonry/Plastic Lining Composite Structures." In CORROSION 1997. NACE International, 1997. https://doi.org/10.5006/c1997-97363.

Full text

Abstract:

Abstract The continued development of plastics with improved corrosion resistance has extended the conditions in which plastics can perform satisfactorily as corrosion resistant linings on steel. The use of a masonry lining over the plastic “membrane” further extends the conditions of service to higher temperatures and more severe mechanical conditions. This type of composite structure consisting of a steel vessel lined with a plastic membrane protected by brick set in resin and/or inorganic mortars presents a number of design challenges. The composite structure must be selected to perform sat

APA, Harvard, Vancouver, ISO, and other styles

4

Gusev, Vasily Vasilievich. "Game of vertex cover of a graph." In Academician O.B. Lupanov 14th International Scientific Seminar "Discrete Mathematics and Its Applications". Keldysh Institute of Applied Mathematics, 2022. http://dx.doi.org/10.20948/dms-2022-56.

Full text

Abstract:

The paper considers the problem of finding the significance of vertices in vertex cover of a graph based on its topology. Index computed Shapley-Shubik in a cooperative game of vertex cover for some graph classes.

APA, Harvard, Vancouver, ISO, and other styles

5

Mariano, Matheus Monteiro, Érica Ferreira Souza, André Takeshi Endo, and Nandamudi L. Vijaykumar. "A comparative study of algorithms for generating switch cover test sets." In XV Simpósio Brasileiro de Qualidade de Software. Sociedade Brasileira de Computação - SBC, 2016. http://dx.doi.org/10.5753/sbqs.2016.15122.

Full text

Abstract:

Test case generation based on Finite State Machines (FSMs) has been extensively investigated due to its accuracy and simplicity. Several test criteria have been proposed in the literature to generate test cases based on FSMs. One of the oldest criteria is the Switch Cover. As a main feature, the Switch Cover criterion defines that all transition pairs of an FSM must be covered. The classical Switch Cover algorithm converts the FSM into a graph (known as Dual Graph); this graph is balanced, and, finally, traversed based on an Eulerian Cycle algorithm. In this context, considering the stage wher

APA, Harvard, Vancouver, ISO, and other styles

6

Botler, Fábio, and Luiz Hoffmann. "Decomposition of (2k+1)-regular graphs containing special spanning 2k-regular Cayley graphs into paths of length 2k+1." In Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2020. http://dx.doi.org/10.5753/etc.2020.11078.

Full text

Abstract:

A Pl-decomposition of a graph G is a set of paths with l edges in G that cover the edge set of G. Favaron, Genest, and Kouider (2010) conjectured that every (2k+1)-regular graph that contains a perfect matching admits a P2k+1-decomposition. They also verified this conjecture for 5-regular graphs without cycles of length 4. In 2015, Botler, Mota, and Wakabayashi extended this result to 5-regular graphs without triangles. In this paper, we verify this conjecture for (2k+1)-regular graphs that contain the k-th power of a spanning cycle; and for 5-regular graphs that contain certain spanning 4-reg

APA, Harvard, Vancouver, ISO, and other styles

7

Gangatharan, Venkat Narayanan, Suresh Suseela, and Kala Rukhmoni. "On 2−simple graphoidal cover of a graph." In 1ST INTERNATIONAL CONFERENCE ON MATHEMATICAL TECHNIQUES AND APPLICATIONS: ICMTA2020. AIP Publishing, 2020. http://dx.doi.org/10.1063/5.0025497.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Divsalar, Dariush, and Lara Dolecek. "Graph cover ensembles of non-binary protograph LDPC codes." In 2012 IEEE International Symposium on Information Theory - ISIT. IEEE, 2012. http://dx.doi.org/10.1109/isit.2012.6283972.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Skachek, Vitaly. "Characterization of graph-cover pseudocodewords of codes over F3." In 2010 IEEE Information Theory Workshop (ITW 2010). IEEE, 2010. http://dx.doi.org/10.1109/cig.2010.5592884.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Lamač, Jan, and Miloslav Vlasák. "Finding vertex-disjoint cycle cover of undirected graph using the least-squares method." In Programs and Algorithms of Numerical Mathematics 21. Institute of Mathematics, Czech Academy of Sciences, 2023. http://dx.doi.org/10.21136/panm.2022.10.

Full text

Abstract:

We investigate the properties of the least-squares solution of the system of equations with a matrix being the incidence matrix of a given undirected connected graph $G$ and we propose an algorithm that uses this solution for finding a vertex-disjoint cycle cover (2-factor) of the graph $G$.

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Cover graph"

1

Lundgren, J. R., and John S. Maybee. Graphs and Matrices: Combinatorial Analysis, Competitions, Covers and Ranks. Defense Technical Information Center, 1993. http://dx.doi.org/10.21236/ada280480.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Rosenblatt, David, Henry Mooney, Khamal Clayton, et al. Open configuration options Caribbean Economics Quarterly: Volume 11: Issue 1, February 2022: Year in Review in Graphs: Economic Story of 2021 in a Series of Graphs. Inter-American Development Bank, 2022. http://dx.doi.org/10.18235/0004018.

Full text

Abstract:

Last year ended with incipient but fragile economic recoveries in most Caribbean economies. Relatively low vaccination rates remain a concern in the six countries covered by the Caribbean Country Department of the IDB. The sharp rise in commodity prices bolster prospects for commodity exporters in the region, but they also dampen prospects for tourism dependent economies. This edition of the Caribbean Quarterly Bulletin provides a “Year in Review in Graphs” for the overall region and each of the six countries. The graphs cover the evolution of key macroeconomic variable during the course of 20

APA, Harvard, Vancouver, ISO, and other styles

3

Nieto-Castanon, Alfonso. CONN functional connectivity toolbox (RRID:SCR_009550), Version 18. Hilbert Press, 2018. http://dx.doi.org/10.56441/hilbertpress.1818.9585.

Full text

Abstract:

CONN is a Matlab-based cross-platform software for the computation, display, and analysis of functional connectivity in fMRI (fcMRI). Connectivity measures include seed-to-voxel connectivity maps, ROI-to- ROI connectivity matrices, graph properties of connectivity networks, generalized psychophysiological interaction models (gPPI), intrinsic connectivity, local correlation and other voxel-to-voxel measures, independent component analyses (ICA), and dynamic component analyses (dyn-ICA). CONN is available for resting state data (rsfMRI) as well as task-related designs. It covers the entire pipel

APA, Harvard, Vancouver, ISO, and other styles

4

Nieto-Castanon, Alfonso. CONN functional connectivity toolbox (RRID:SCR_009550), Version 20. Hilbert Press, 2020. http://dx.doi.org/10.56441/hilbertpress.2048.3738.

Full text

Abstract:

CONN is a Matlab-based cross-platform software for the computation, display, and analysis of functional connectivity in fMRI (fcMRI). Connectivity measures include seed-to-voxel connectivity maps, ROI-to- ROI connectivity matrices, graph properties of connectivity networks, generalized psychophysiological interaction models (gPPI), intrinsic connectivity, local correlation and other voxel-to-voxel measures, independent component analyses (ICA), and dynamic component analyses (dyn-ICA). CONN is available for resting state data (rsfMRI) as well as task-related designs. It covers the entire pipel

APA, Harvard, Vancouver, ISO, and other styles

5

Nieto-Castanon, Alfonso. CONN functional connectivity toolbox (RRID:SCR_009550), Version 19. Hilbert Press, 2019. http://dx.doi.org/10.56441/hilbertpress.1927.9364.

Full text

Abstract:

CONN is a Matlab-based cross-platform software for the computation, display, and analysis of functional connectivity in fMRI (fcMRI). Connectivity measures include seed-to-voxel connectivity maps, ROI-to- ROI connectivity matrices, graph properties of connectivity networks, generalized psychophysiological interaction models (gPPI), intrinsic connectivity, local correlation and other voxel-to-voxel measures, independent component analyses (ICA), and dynamic component analyses (dyn-ICA). CONN is available for resting state data (rsfMRI) as well as task-related designs. It covers the entire pipel

APA, Harvard, Vancouver, ISO, and other styles

6

Turgeon, Mathieu. Causal Modeling with Regression Discontinuity Designs (RDD). Instats Inc., 2023. http://dx.doi.org/10.61700/s3nl5lfnmruqw469.

Full text

Abstract:

This seminar introduces the use of the regression discontinuity design (RDD) to estimate treatment effects from observational data. Day 1 topics include directed acyclic graphs (DAG), potential outcomes framework and associated assumptions, the sharp regression discontinuity design, and tools for visualizing discontinuities. Day 2 topics focus on the estimation of values of interest from a regression discontinuity design, adopting a continuity-based approach to RD analysis. Day 2 will also cover issues related to the validation and falsification of the regression discontinuity design. An offic

APA, Harvard, Vancouver, ISO, and other styles

7

Turgeon, Mathieu. Causal Modeling with Regression Discontinuity Designs (RDD). Instats Inc., 2023. http://dx.doi.org/10.61700/o6e22r1sh4h7m469.

Full text

Abstract:

This seminar introduces the use of the regression discontinuity design (RDD) to estimate treatment effects from observational data. Sessions 1-3 topics include directed acyclic graphs (DAG), potential outcomes framework and associated assumptions, the sharp regression discontinuity design, and tools for visualizing discontinuities. Sessions 4-6 topics focus on the estimation of values of interest from a regression discontinuity design, adopting a continuity-based approach to RD analysis. Day 2 will also cover issues related to the validation and falsification of the regression discontinuity de

APA, Harvard, Vancouver, ISO, and other styles

8

Heitman, Joshua L., Alon Ben-Gal, Thomas J. Sauer, Nurit Agam, and John Havlin. Separating Components of Evapotranspiration to Improve Efficiency in Vineyard Water Management. United States Department of Agriculture, 2014. http://dx.doi.org/10.32747/2014.7594386.bard.

Full text

Abstract:

Vineyards are found on six of seven continents, producing a crop of high economic value with much historic and cultural significance. Because of the wide range of conditions under which grapes are grown, management approaches are highly varied and must be adapted to local climatic constraints. Research has been conducted in the traditionally prominent grape growing regions of Europe, Australia, and the western USA, but far less information is available to guide production under more extreme growing conditions. The overarching goal of this project was to improve understanding of vineyard water

APA, Harvard, Vancouver, ISO, and other styles

9

Sprague, Joshua, David Kushner, James Grunden, Jamie McClain, Benjamin Grime, and Cullen Molitor. Channel Islands National Park Kelp Forest Monitoring Program: Annual report 2014. National Park Service, 2022. http://dx.doi.org/10.36967/2293855.

Full text

Abstract:

Channel Islands National Park (CHIS) has conducted long-term ecological monitoring of the kelp forests around San Miguel, Santa Rosa, Santa Cruz, Anacapa and Santa Barbara Islands since 1982. The original permanent transects were established at 16 sites between 1981 and 1986 with the first sampling beginning in 1982, this being the 33rd year of monitoring. An additional site, Miracle Mile, was established at San Miguel Island in 2001 by a commercial fisherman with assistance from the park. Miracle Mile was partially monitored from 2002 to 2004, and then fully monitored (using all KFM protocols

APA, Harvard, Vancouver, ISO, and other styles

10

Saltus, Christina, Molly Reif, and Richard Johansen. waterquality for ArcGIS Pro Toolbox. Engineer Research and Development Center (U.S.), 2021. http://dx.doi.org/10.21079/11681/42240.

Full text

Abstract:

Monitoring water quality of small inland lakes and reservoirs is a critical component of USACE water quality management plans. However, limited resources for traditional field-based monitoring of numerous lakes and reservoirs that cover vast geographic areas often leads to reactional responses to harmful algal bloom (HAB) outbreaks. Satellite remote sensing methodologies using HAB indicators is a good low-cost option to traditional methods and has been proven to maximize and complement current field-based approaches while providing a synoptic view of water quality (Beck et al. 2016; Beck et al

APA, Harvard, Vancouver, ISO, and other styles

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!