Relevant bibliographies by topics / Regular graphs

Contents

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

Academic literature on the topic 'Regular graphs'

Author: Grafiati
Published: 4 June 2021
Last updated: 25 April 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 'Regular graphs.'

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 "Regular graphs"

1

Šoltés, Ľubomír. "Regular graphs with regular neighborhoods." Glasgow Mathematical Journal 34, no. 2 (May 1992): 215–18. http://dx.doi.org/10.1017/s0017089500008740.

Full text
Abstract:
The existence of r-regular graphs such that each edge lies in exactly t triangles, for given integers t < r, is studied. If t is sufficiently close to r then each such connected graph has to be the complete multipartite graph. Relations to graphs with isomorphic neighborhoods are also considered.
APA, Harvard, Vancouver, ISO, and other styles
2

Zelinka, Bohdan. "Locally regular graphs." Mathematica Bohemica 125, no. 4 (2000): 481–84. http://dx.doi.org/10.21136/mb.2000.126271.

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

Markhabatov, Nurlan, and Sergey Sudoplatov. "APPROXIMATIONS OF REGULAR GRAPHS." Herald of Kazakh-British technical university 19, no. 1 (March 31, 2022): 44–49. http://dx.doi.org/10.55452/1998-6688-2022-19-1-44-49.

Full text
Abstract:
The paper [11] raised the question of describing the cardinality and types of approximations for natural families of theories. In the present paper, a partial answer to this question is given, and the study of approximation and topological properties of natural classes of theories is also continued. We consider a cycle graph consisting of one cycle or, in other words, a certain number of vertices (at least 3 if the graph is simple) connected into a closed chain. It is shown that an infinite cycle graph is approximated by finite cycle graphs. Approximations of regular graphs by finite regular graphs are considered. On the other hand, approximations of acyclic regular graphs by finite regular graphs are considered. It is proved that any infinite regular graph is pseudofinite. And also, for any k, any k-regular graph is homogeneous and pseudofinite.Examples of pseudofinite 3-regular and 4-regular graphs are given.
APA, Harvard, Vancouver, ISO, and other styles
4

Ivančo, Jaroslav. "On supermagic regular graphs." Mathematica Bohemica 125, no. 1 (2000): 99–114. http://dx.doi.org/10.21136/mb.2000.126259.

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

Guest, Kelly B., James M. Hammer, Peter D. Johnson, and Kenneth J. Roblee. "Regular clique assemblies, configurations, and friendship in Edge-Regular graphs." Tamkang Journal of Mathematics 48, no. 4 (December 30, 2017): 301–20. http://dx.doi.org/10.5556/j.tkjm.48.2017.2237.

Full text
Abstract:
An edge-regular graph is a regular graph in which, for some $\lambda$, any two adjacent vertices have exactly $\lambda$ common neighbors. This paper is about the existence and structure of edge-regular graphs with $\lambda =1$ and about edge-regular graphs with $\lambda >1$ which have local neighborhood structure analogous to that of the edge-regular graphs with $\lambda =1$.
APA, Harvard, Vancouver, ISO, and other styles
6

Athul, T. B., and G. Suresh Singh. "TOTAL GRAPH OF REGULAR GRAPHS." Advances in Mathematics: Scientific Journal 9, no. 6 (July 20, 2020): 4213–20. http://dx.doi.org/10.37418/amsj.9.6.103.

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

Wang, Changping. "Voting 'Against' in regular and nearly regular graphs." Applicable Analysis and Discrete Mathematics 4, no. 1 (2010): 207–18. http://dx.doi.org/10.2298/aadm100213014w.

Full text
Abstract:
Let G = (V,E) be a graph. A function f : V (G)-> {-1,1} is called negative if ?vEN[v] f(v)?1 for every v E V(G): A negative function f of a graph G is maximal if there exists no negative function g such that g ? f and g(v) ? f(v) for every v E V: The minimum of the values of ?vEV f(v); taken over all maximal negative functions f, is called the lower against number and is denoted by ?*N (G): In this paper, we present lower bounds on this number for regular graphs and nearly regular graphs, and we characterize the graphs attaining those bounds.
APA, Harvard, Vancouver, ISO, and other styles
8

Seethalakshmi, R., and R. B. Gnanajothi. "Strong Regular L-Fuzzy Graphs." International Journal of Trend in Scientific Research and Development Volume-1, Issue-5 (August 31, 2017): 503–9. http://dx.doi.org/10.31142/ijtsrd2333.

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

Gyürki, Štefan. "Small Directed Strongly Regular Graphs." Algebra Colloquium 27, no. 01 (February 25, 2020): 11–30. http://dx.doi.org/10.1142/s1005386720000036.

Full text
Abstract:
The goal of the present paper is to provide a gallery of small directed strongly regular graphs. For each graph of order n ≤ 12 and valency k < n/2, a diagram is depicted, its relation to other small directed strongly regular graphs is revealed, the full group of automorphisms is described, and some other nice properties are given. To each graph a list of interesting subgraphs is provided as well.
APA, Harvard, Vancouver, ISO, and other styles
10

Et. al., PuruchothamaNayakiM. "Distance Based Topological Indices And Regular Graphs." Turkish Journal of Computer and Mathematics Education (TURCOMAT) 12, no. 3 (April 11, 2021): 5191–96. http://dx.doi.org/10.17762/turcomat.v12i3.2147.

Full text
Abstract:
In this article, we are using the regular graph of even number of vertices and computing the distance balanced graphs. First we take a graph for satisfying regular definition and then we compute the Mostar index of that particular graph. If the Mostar index of that particular graph is zero, then the graph is said to be a distance balanced graph. So we discuss first distance balanced graph. Suppose if we delete one edge in that particular graph, that is non-regular graph, we can verify the balanced graph is whether distance balanced graph or not. We discuss and compute the Mostar index of certain regular and non-regular graphs are balanced distance or not. Finally we see few theorems are related in this topic. So in this paper, we study some distance based topological indices for regular graphs and also cubic graphs.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Regular graphs"

1

Hoffmann, Arne. "Regular factors in graphs." [S.l.] : [s.n.], 2002. http://deposit.ddb.de/cgi-bin/dokserv?idn=965227979.

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

Macon, Lisa. "ALMOST REGULAR GRAPHS AND EDGE FACE COLORINGS OF PLANE GRAPHS." Doctoral diss., University of Central Florida, 2009. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/2480.

Full text
Abstract:
Regular graphs are graphs in which all vertices have the same degree. Many properties of these graphs are known. Such graphs play an important role in modeling network configurations where equipment limitations impose a restriction on the maximum number of links emanating from a node. These limitations do not enforce strict regularity, and it becomes interesting to investigate nonregular graphs that are in some sense close to regular. This dissertation explores a particular class of almost regular graphs in detail and defines generalizations on this class. A linear-time algorithm for the creation of arbitrarily large graphs of the discussed class is provided, and a polynomial-time algorithm for recognizing graphs in the class is given. Several invariants for the class are discussed. The edge-face chromatic number χef of a plane graph G is the minimum number of colors that must be assigned to the edges and faces of G such that no edge or face of G receives the same color as an edge or face with which it is incident or adjacent. A well-known result for the upper bound of χef exists for graphs with maximum degree Δ ≥ 10. We present a tight upper bound for plane graphs with Δ = 9.
Ph.D.
Department of Mathematics
Sciences
Mathematics PhD
APA, Harvard, Vancouver, ISO, and other styles
3

Mortada, Maidoun. "The b-chromatic number of regular graphs." Thesis, Lyon 1, 2013. http://www.theses.fr/2013LYO10116.

Full text
Abstract:
Les deux problèmes majeurs considérés dans cette thèse : le b-coloration problème et le graphe emballage problème. 1. Le b-coloration problème : Une coloration des sommets de G s'appelle une b-coloration si chaque classe de couleur contient au moins un sommet qui a un voisin dans toutes les autres classes de couleur. Le nombre b-chromatique b(G) de G est le plus grand entier k pour lequel G a une b-coloration avec k couleurs. EL Sahili et Kouider demandent s'il est vrai que chaque graphe d-régulier G avec le périmètre au moins 5 satisfait b(G) = d + 1. Blidia, Maffray et Zemir ont montré que la conjecture d'El Sahili et de Kouider est vraie pour d ≤ 6. En outre, la question a été résolue pour les graphes d-réguliers dans des conditions supplémentaires. Nous étudions la conjecture d'El Sahili et de Kouider en déterminant quand elle est possible et dans quelles conditions supplémentaires elle est vrai. Nous montrons que b(G) = d + 1 si G est un graphe d-régulier qui ne contient pas un cycle d'ordre 4 ni d'ordre 6. En outre, nous fournissons des conditions sur les sommets d'un graphe d-régulier G sans le cycle d'ordre 4 de sorte que b(G) = d + 1. Cabello et Jakovac ont prouvé si v(G) ≥ 2d3 - d2 + d, puis b(G) = d + 1, où G est un graphe d-régulier. Nous améliorons ce résultat en montrant que si v(G) ≥ 2d3 - 2d2 + 2d alors b(G) = d + 1 pour un graphe d-régulier G. 2. Emballage de graphe problème : Soit G un graphe d'ordre n. Considérer une permutation σ : V (G) → V (Kn), la fonction σ* : E(G) → E(Kn) telle que σ *(xy) = σ *(x) σ *(y) est la fonction induite par σ. Nous disons qu'il y a un emballage de k copies de G (dans le graphe complet Kn) s'il existe k permutations σi : V (G) → V (Kn), où i = 1, …, k, telles que σi*(E(G)) ∩ σj (E(G)) = ɸ pour i ≠ j. Un emballage de k copies d'un graphe G est appelé un k-placement de G. La puissance k d'un graphe G, noté par Gk, est un graphe avec le même ensemble de sommets que G et une arête entre deux sommets si et seulement si le distance entre ces deux sommets est au plus k. Kheddouci et al. ont prouvé que pour un arbre non-étoile T, il existe un 2-placement σ sur V (T). Nous introduisons pour la première fois le problème emballage marqué de graphe dans son graphe puissance
Two problems are considered in this thesis: the b-coloring problem and the graph packing problem. 1. The b-Coloring Problem : A b-coloring of a graph G is a proper coloring of the vertices of G such that there exists a vertex in each color class joined to at least a vertex in each other color class. The b-chromatic number of a graph G, denoted by b(G), is the maximum number t such that G admits a b-coloring with t colors. El Sahili and Kouider asked whether it is true that every d-regular graph G with girth at least 5 satisfies b(G) = d + 1. Blidia, Maffray and Zemir proved that the conjecture is true for d ≤ 6. Also, the question was solved for d-regular graphs with supplementary conditions. We study El Sahili and Kouider conjecture by determining when it is possible and under what supplementary conditions it is true. We prove that b(G) = d+1 if G is a d-regular graph containing neither a cycle of order 4 nor of order 6. Then, we provide specific conditions on the vertices of a d-regular graph G with no cycle of order 4 so that b(G) = d + 1. Cabello and Jakovac proved that if v(G) ≥ 2d3 - d2 + d, then b(G) = d + 1, where G is a d-regular graph. We improve this bound by proving that if v(G) ≥ 2d3 - 2d2 + 2d, then b(G) = d+1 for a d-regular graph G. 2. Graph Packing Problem : Graph packing problem is a classical problem in graph theory and has been extensively studied since the early 70's. Consider a permutation σ : V (G) → V (Kn), the function σ* : E(G) → E(Kn) such that σ *(xy) = σ *(x) σ *(y) is the function induced by σ. We say that there is a packing of k copies of G into the complete graph Kn if there exist k permutations σ i : V (G) → V (Kn), where i = 1,…, k, such that σ*i (E(G)) ∩ σ*j (E(G)) = ɸ for I ≠ j. A packing of k copies of a graph G will be called a k-placement of G. The kth power Gk of a graph G is the supergraph of G formed by adding an edge between all pairs of vertices of G with distance at most k. Kheddouci et al. proved that for any non-star tree T there exists a 2-placement σ on V (T). We introduce a new variant of graph packing problem, called the labeled packing of a graph into its power graph
APA, Harvard, Vancouver, ISO, and other styles
4

Wu, Taoyang. "Regular configurations and TBR graphs." Thesis, Queen Mary, University of London, 2009. http://qmro.qmul.ac.uk/xmlui/handle/123456789/138.

Full text
Abstract:
This thesis consists of two parts: The first one is concerned with the theory and applications of regular configurations; the second one is devoted to TBR graphs. In the first part, a new approach is proposed to study regular configurations, an extremal arrangement of necklaces formed by a given number of red beads and black beads. We first show that this concept is closely related to several other concepts studied in the literature, such as balanced words, maximally even sets, and the ground states in the Kawasaki-Ising model. Then we apply regular configurations to solve the (vertex) cycle packing problem for shift digraphs, a family of Cayley digraphs. TBR is one of widely used tree rearrangement operationes, and plays an important role in heuristic algorithms for phylogenetic tree reconstruction. In the second part of this thesis we study various properties of TBR graphs, a family of graphs associated with the TBR operation. To investigate the degree distribution of the TBR graphs, we also study -index, a concept introduced to measure the shape of trees. As an interesting by-product, we obtain a structural characterization of good trees, a well-known family of trees that generalizes the complete binary trees.
APA, Harvard, Vancouver, ISO, and other styles
5

Macon, Lisa Fischer. "Almost regular graphs and edge-face colorings of plane graphs." Orlando, Fla. : University of Central Florida, 2009. http://purl.fcla.edu/fcla/etd/CFE0002507.

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

High, David. "On 4-Regular Planar Hamiltonian Graphs." TopSCHOLAR®, 2006. http://digitalcommons.wku.edu/theses/277.

Full text
Abstract:
In order to research knots with large crossing numbers, one would like to be able to select a random knot from the set of all knots with n crossings with as close to uniform probability as possible. The underlying graph of a knot diagram can be viewed as a 4-regular planar graph. The existence of a Hamiltonian cycle in such a graph is necessary in order to use the graph to compute an upper bound on rope length for a given knot. The algorithm to generate such graphs is discussed and an exact count of the number of graphs is obtained. In order to allow for the existence of such a count, a somewhat technical definition of graph equivalence is used. The main result of the thesis is the asymptotic results of how fast the number of graphs with n vertices (crossings) grows with n.
APA, Harvard, Vancouver, ISO, and other styles
7

Janmark, Jonatan. "Quantum Search on Strongly Regular Graphs." Thesis, KTH, Teoretisk fysik, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-126266.

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

Beis, Michail. "Greedy algorithms for random regular graphs." Thesis, University of Liverpool, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.427021.

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

Gasquoine, Sarah Louise. "Finite and infinite extensions of regular graphs." Thesis, Queen Mary, University of London, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.313750.

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

Davies, Ewan. "Extremal and probabilistic results for regular graphs." Thesis, London School of Economics and Political Science (University of London), 2017. http://etheses.lse.ac.uk/3615/.

Full text
Abstract:
In this thesis we explore extremal graph theory, focusing on new methods which apply to different notions of regular graph. The first notion is dregularity, which means each vertex of a graph is contained in exactly d edges, and the second notion is Szemerédi regularity, which is a strong, approximate version of this property that relates to pseudorandomness. We begin with a novel method for optimising observables of Gibbs distributions in sparse graphs. The simplest application of the method is to the hard-core model, concerning independent sets in d-regular graphs, where we prove a tight upper bound on an observable known as the occupancy fraction. We also cover applications to matchings and colourings, in each case proving a tight bound on an observable of a Gibbs distribution and deriving an extremal result on the number of a relevant combinatorial structure in regular graphs. The results relate to a wide range of topics including statistical physics and Ramsey theory. We then turn to a form of Szemerédi regularity in sparse hypergraphs, and develop a method for embedding complexes that generalises a widely-applied method for counting in pseudorandom graphs. We prove an inheritance lemma which shows that the neighbourhood of a sparse, regular subgraph of a highly pseudorandom hypergraph typically inherits regularity in a natural way. This shows that we may embed complexes into suitable regular hypergraphs vertex-by-vertex, in much the same way as one can prove a counting lemma for regular graphs. Finally, we consider the multicolour Ramsey number of paths and even cycles. A well-known density argument shows that when the edges of a complete graph on kn vertices are coloured with k colours, one can find a monochromatic path on n vertices. We give an improvement to this bound by exploiting the structure of the densest colour, and use the regularity method to extend the result to even cycles.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Regular graphs"

1

Brouwer, A. E. Distance-regular graphs. Berlin: Springer-Verlag, 1989.

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

Brouwer, Andries E., Arjeh M. Cohen, and Arnold Neumaier. Distance-Regular Graphs. Berlin, Heidelberg: Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/978-3-642-74341-2.

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

Jerrum, Mark. Fast uniform generation of regular graphs. Edinburgh: University of Edinburgh Department of Computer Science, 1988.

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

Eshghi, Kourosh. The existence and construction of gas-valuations of 2-regular graphs with three components. Ottawa: National Library of Canada = Bibliothèque nationale du Canada, 1997.

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

Klanten, Robert. Regular: Graphic design today. Berlin: Die Gestalten Verlag, 2009.

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

Reggini, Horacio C. Regular polyhedra: Random generation, Hamiltonian paths, and single chain nets. Buenos Aires: Academia Nacional de Ciencias Exactas, Físicas y Naturales, 1991.

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

Differentiating instruction in the regular classroom: How to reach and teach all learners, grades 3-12. Minneapolis, MN: Free Spirit Pub., 2002.

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

Heacox, Diane. Differentiating instruction in the regular classroom: How to reach and teach all learners, grades K-12. Minneapolis, MN: Free Spirit Publishing, 2012.

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

Affairs, United States Congress Senate Select Committee on Indian. Authorizing consolidated grants to Indian tribal governments to regulate environmental quality on Indian reservations: Report (to accompany S. 668). [Washington, D.C.?: U.S. G.P.O., 1991.

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

Commons, Canada Parliament House of. Bill: An act to regulate freight and passenger rates on railways. Ottawa: S.E. Dawson, 2002.

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

Book chapters on the topic "Regular graphs"

1

Bapat, Ravindra B. "Regular Graphs." In Universitext, 69–85. London: Springer London, 2014. http://dx.doi.org/10.1007/978-1-4471-6569-9_6.

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

Cioabă, Sebastian M., and M. Ram Murty. "Regular Graphs." In A First Course in Graph Theory and Combinatorics, 141–59. Gurgaon: Hindustan Book Agency, 2009. http://dx.doi.org/10.1007/978-93-86279-39-2_12.

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

Brouwer, Andries E., Arjeh M. Cohen, and Arnold Neumaier. "Sporadic Graphs." In Distance-Regular Graphs, 391–412. Berlin, Heidelberg: Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/978-3-642-74341-2_13.

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

Brouwer, Andries E., Arjeh M. Cohen, and Arnold Neumaier. "Special Regular Graphs." In Distance-Regular Graphs, 1–42. Berlin, Heidelberg: Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/978-3-642-74341-2_1.

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

Brouwer, Andries E., Arjeh M. Cohen, and Arnold Neumaier. "Distance-Transitive Graphs." In Distance-Regular Graphs, 214–34. Berlin, Heidelberg: Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/978-3-642-74341-2_7.

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

Brouwer, Andries E., Arjeh M. Cohen, and Arnold Neumaier. "Graphs of Coxeter and Lie Type." In Distance-Regular Graphs, 294–344. Berlin, Heidelberg: Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/978-3-642-74341-2_10.

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

Brouwer, Andries E., Arjeh M. Cohen, and Arnold Neumaier. "Graphs Related to Codes." In Distance-Regular Graphs, 345–73. Berlin, Heidelberg: Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/978-3-642-74341-2_11.

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

Brouwer, Andries E., Arjeh M. Cohen, and Arnold Neumaier. "Graphs Related to Classical Geometries." In Distance-Regular Graphs, 374–90. Berlin, Heidelberg: Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/978-3-642-74341-2_12.

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

Brouwer, Andries E., Arjeh M. Cohen, and Arnold Neumaier. "Tables of Parameters for Distance Regular Graphs." In Distance-Regular Graphs, 413–32. Berlin, Heidelberg: Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/978-3-642-74341-2_14.

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

Brouwer, Andries E., Arjeh M. Cohen, and Arnold Neumaier. "Association Schemes." In Distance-Regular Graphs, 43–78. Berlin, Heidelberg: Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/978-3-642-74341-2_2.

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

Conference papers on the topic "Regular graphs"

1

Gilroy, Sorcha, Adam Lopez, and Sebastian Maneth. "Parsing Graphs with Regular Graph Grammars." In Proceedings of the 6th Joint Conference on Lexical and Computational Semantics (*SEM 2017). Stroudsburg, PA, USA: Association for Computational Linguistics, 2017. http://dx.doi.org/10.18653/v1/s17-1024.

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

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-regular Cayley graphs.
APA, Harvard, Vancouver, ISO, and other styles
3

Kim, Jeong Han, and Van H. Vu. "Generating random regular graphs." In the thirty-fifth ACM symposium. New York, New York, USA: ACM Press, 2003. http://dx.doi.org/10.1145/780542.780576.

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

Mesnager, Sihem, and Ahmet Sinak. "Strongly Regular Graphs from Weakly Regular Plateaued Functions*." In 2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA). IEEE, 2019. http://dx.doi.org/10.1109/iwsda46143.2019.8966118.

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

Varma, Rohan, Siheng Chen, and Jelena Kovacevic. "Graph topology recovery for regular and irregular graphs." In 2017 IEEE 7th International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP). IEEE, 2017. http://dx.doi.org/10.1109/camsap.2017.8313202.

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

Sinha, Deepa, Anita Kumari Rao, and Pravin Garg. "Embedding of (i, j)-regular signed graphs in (i + k, j + l)-regular signed graphs." In 2016 International Workshop on Computational Intelligence (IWCI). IEEE, 2016. http://dx.doi.org/10.1109/iwci.2016.7860368.

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

Nolé, Maurizio, and Carlo Sartiani. "Regular Path Queries on Massive Graphs." In SSDBM '16: Conference on Scientific and Statistical Database Management. New York, NY, USA: ACM, 2016. http://dx.doi.org/10.1145/2949689.2949711.

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

Gao, Pu, and Nicholas Wormald. "Uniform Generation of Random Regular Graphs." In 2015 IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 2015. http://dx.doi.org/10.1109/focs.2015.78.

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

Li, Fengwei, Qingfang Ye, and Shuhua Wang. "Neighbor-scattering number in regular graphs." In 2011 International Conference on Multimedia Technology (ICMT). IEEE, 2011. http://dx.doi.org/10.1109/icmt.2011.6002618.

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

Novocin, Andrew, David Saunders, Alexander Stachnik, and Bryan Youse. "3-ranks for strongly regular graphs." In PASCO '15: International Workshop on Parallel Symbolic Computation. New York, NY, USA: ACM, 2015. http://dx.doi.org/10.1145/2790282.2790295.

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

Reports on the topic "Regular graphs"

1

Pinter, Michael P. Planar Regular One-Well-Covered Graphs. Fort Belvoir, VA: Defense Technical Information Center, January 1991. http://dx.doi.org/10.21236/ada261946.

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

Castillo-Pichardo, Linette. Grape Polyphenol Signaling to Regulate Breast Cancer Metastasis. Fort Belvoir, VA: Defense Technical Information Center, September 2009. http://dx.doi.org/10.21236/ada516581.

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

Carneiro, Pedro, Sofía Castro Vargas, Yyannú Cruz-Aguayo, Gregory Elacqua, Nicolás Fuertes, and Norbert Schady. Medium-Term Impacts of Access to Daycare on School Outcomes: Experimental Evidence from Rio de Janeiro. Inter-American Development Bank, April 2021. http://dx.doi.org/10.18235/0003236.

Full text
Abstract:
In this document we analyze the impacts of a large-scale intervention that provided access to daycare centers for children in low-income neighborhoods in the city of Rio de Janeiro. Our results suggest that the intervention had a positive impact on enrollment rates and on the number of years children were enrolled to daycare during early childhood. We also find that winning the lottery had a positive effect on how regularly children attended primary school during the academic year. Because of the high attrition rates in the sample, we are unable to conclude whether the lottery had a positive impact on medium-term academic outcomes like standardized tests scores and overall grades.
APA, Harvard, Vancouver, ISO, and other styles
4

Álvarez Zuluaga, Carlos Andrés, Claudia Espinal Correa, Jorge Humberto Rubio Elorza, and Mauricio Vasco Ramírez. La simulación en salud: una estrategia de evaluación y formación por competencias. Ediciones Universidad Cooperativa de Colombia, November 2021. http://dx.doi.org/10.16925/wpgp.04.

Full text
Abstract:
La simulación clínica no es una novedad. Hace ya mucho se distanció de sus orígenes en la aviación y colonizó áreas como la educación en salud. En este libro se la presenta como una tecnología que, acompañada de recursos como los simuladores y estrechamente ligada al campo de la pedagogía y la didáctica, la pone en un lugar privilegiado dentro de la compleja relación de enseñanza-aprendizaje, es decir, la convierte en una estrategia que contribuye al desarrollo y potenciamiento de las habilidades y destrezas requeridas por las disciplinas en las que se encuentra inmersa, a la vez que favorece la toma de decisiones del futuro profesional, en nuestro caso, del área de la salud. Parte de esto radica en que, una vez insertada en la malla curricular de los programas de educación superior, la simulación permite escalar varios grados de complejidad y situaciones: desde la adquisición de habilidades y destrezas básicas, hasta la compleja toma de decisiones cuya encrucijada pone en tela de juicio la vida de los pacientes. En nuestro caso, la simulación se sitúa bajo un modelo de educación por competencias, acorde con las modalidades y a los requisitos que demandan las instancias gubernamentales que regulan la educación superior que exigen evidencias de lo aprendido y, con ello, el papel de las prácticas académicas (indicadores) en ambientes adecuados. En ese escenario, la simulación da respuesta al profesional que se promete educar bajo una educación atenta a resultados del aprendizaje verificables.
APA, Harvard, Vancouver, ISO, and other styles
5

Or, Etti, Tai-Ping Sun, Amnon Lichter, and Avichai Perl. Characterization and Manipulation of the Primary Components in Gibberellin Signaling in the Grape Berry. United States Department of Agriculture, January 2010. http://dx.doi.org/10.32747/2010.7592649.bard.

Full text
Abstract:
Seedless cultivars dominate the table grape industry. In these cultivars it is mandatory to apply gibberellin (GA) to stimulate berry development to a commercially acceptable size. These cultivars differ in their sensitivity to GA application, and it frequently results in adverse effects such as decreased bud fertility and increased fruit drop. Our long term goals are to (1) understand the molecular basis for the differential sensitivity and identify markers for selection of sensitive cultivars (2) to develop new strategies for targeted manipulation of the grape berry response to GA that will eliminate the need in GA application and the undesirable effects of GA on the vine, while maintaining its desirable effects on the berry. Both strategies are expected to reduce production cost and meet growing consumer demand for reduced use of chemicals. This approach relies on a comprehensive characterization of the central components in the GA signaling cascade in the berry. Several key components in the GA signaling pathway were identified in Arabidopsis and rice, including the GA receptors, GID1s, and a family of DELLA proteins that are the major negative regulators of the GA response. GA activates its response pathway by binding to GID1s, which then target DELLAs for degradation via interaction with SLY, a DELLA specific F-box protein. In grape, only one DELLA gene was characterized prior to this study, which plays a major role in inhibiting GA-promoted stem growth and GA-repressed floral induction but it does not regulate fruit growth. Therefore, we speculated that other DELLA family member(s) may control GA responses in berry, and their identification and manipulation may result in GA-independent berry growth. In the current study we isolated two additional VvDELLA family members, two VvGID1 genes and two VvSLY genes. Arabidopsis anti-AtRGA polyclonal antibodies recognized all three purified VvDELLA proteins, but its interaction with VvDELLA3 was weaker. Overexpression of the VvDELLAs, the VvGID1s, and the VvSLYs in the Arabidopsis mutants ga1-3/rga-24, gid1a-2/1c-2 and sly1-10, respectively, rescued the various mutant phenotypes. In vitro GAdependent physical interaction was shown between the VvDELLAs and the VvGID1s, and GAindependent interaction was shown between the VvDELLAs and VvSLYs. Interestingly, VvDELLA3 did not interact with VvGID1b. Together, the results indicate that the identified grape homologs serve as functional DELLA repressors, receptors and DELLA-interacting F-box proteins. Expression analyses revealed that (1) VvDELLA2 was expressed in all the analyzed tissues and was the most abundant (2) VvDELLA1 was low expressed in berries, confirming former study (3) Except in carpels and very young berries, VvDELLA3 levels were the lowest in most tissues. (4) Expression of both VvGID1s was detected in all the grape tissues, but VvGID1b transcript levels were significantly higher than VvGID1a. (5) In general, both VvDELLAs and VvGID1s transcripts levels increased as tissues aged. Unfertilized and recently fertilized carpels did not follow this trend, suggesting different regulatory mechanism of GA signaling in these stages. Characterization of the response to GA of various organs in three seedless cultivars revealed differential response of the berries and rachis. Interestingly, VvDELLA3 transcript levels in the GA-unresponsive berries of cv. Spring blush were significantly higher compared to their levels in the highly responsive berries of cv. Black finger. Assuming that VvDELLA2 and VvDELLA3 are regulating berry size, constructs carrying potential dominant mutations in each gene were created. Furthermore, constitutive silencing of these genes by mIR is underway, to reveal the effect of each gene on the berry phenotype.
APA, Harvard, Vancouver, ISO, and other styles
6

Rodríguez, Paola, Agustina Calatayud, and Alexander Riobó. Vehículos autónomos y el rol del sector público: Sandbox regulatorio: Guía para formuladores de política en América Latina y el Caribe. Inter-American Development Bank, March 2021. http://dx.doi.org/10.18235/0003089.

Full text
Abstract:
Los beneficios asociados a los vehículos autónomos pueden tener un impacto transformacional en el sector, contribuyendo a un transporte más eficiente, inclusivo y sostenible. Sin embargo, dado el estado embrionario en el despliegue de la tecnología, estos potenciales beneficios aún no se encuentran del todo probados en la realidad. Asimismo, existe una serie de riesgos asociados al vehículo autónomo, que requieren del accionar de los reguladores para su mitigación. En este contexto, el sector público deberá jugar un rol clave en el diseño de un marco regulador que reduzca las barreras de entrada y fomente la innovación en el sector, al tiempo que garantice la implementación tecnológica con adecuados grados de seguridad, confiabilidad y funcionalidad. A su vez, este marco regulatorio debe ser lo suficientemente flexible para adaptarse a medida que evoluciona la tecnología. Los países de América Latina y el Caribe (ALC) se encuentran muy rezagados en los ámbitos de investigación, testeo y debate público de esta tecnología en comparación a países avanzados. Con el fin de contribuir a cerrar esta brecha, este documento identifica las prácticas más habituales y lecciones aprendidas en diez países líderes a nivel mundial, para guiar las iniciativas que se realicen en la región. El enfoque que se ha identificado mayoritariamente en esta muestra de geografías ha sido el de sandbox regulatorio, conforme al cual se van desarrollando pruebas mientras la tecnología madura, creando entornos seguros y que permitan la innovación. Así, en este documento se presenta una guía para implementar sandboxes regulatorios de despliegue de vehículos autónomos en ALC.
APA, Harvard, Vancouver, ISO, and other styles
7

Fridman, Eyal, Jianming Yu, and Rivka Elbaum. Combining diversity within Sorghum bicolor for genomic and fine mapping of intra-allelic interactions underlying heterosis. United States Department of Agriculture, January 2012. http://dx.doi.org/10.32747/2012.7597925.bard.

Full text
Abstract:
Heterosis, the enigmatic phenomenon in which whole genome heterozygous hybrids demonstrate superior fitness compared to their homozygous parents, is the main cornerstone of modern crop plant breeding. One explanation for this non-additive inheritance of hybrids is interaction of alleles within the same locus. This proposal aims at screening, identifying and investigating heterosis trait loci (HTL) for different yield traits by implementing a novel integrated mapping approach in Sorghum bicolor as a model for other crop plants. Originally, the general goal of this research was to perform a genetic dissection of heterosis in a diallel built from a set of Sorghum bicolor inbred lines. This was conducted by implementing a novel computational algorithm which aims at associating between specific heterozygosity found among hybrids with heterotic variation for different agronomic traits. The initial goals of the research are: (i) Perform genotype by sequencing (GBS) of the founder lines (ii) To evaluate the heterotic variation found in the diallel by performing field trails and measurements in the field (iii) To perform QTL analysis for identifying heterotic trait loci (HTL) (iv) to validate candidate HTL by testing the quantitative mode of inheritance in F2 populations, and (v) To identify candidate HTL in NAM founder lines and fine map these loci by test-cross selected RIL derived from these founders. The genetic mapping was initially achieved with app. 100 SSR markers, and later the founder lines were genotyped by sequencing. In addition to the original proposed research we have added two additional populations that were utilized to further develop the HTL mapping approach; (1) A diallel of budding yeast (Saccharomyces cerevisiae) that was tested for heterosis of doubling time, and (2) a recombinant inbred line population of Sorghum bicolor that allowed testing in the field and in more depth the contribution of heterosis to plant height, as well as to achieve novel simulation for predicting dominant and additive effects in tightly linked loci on pseudooverdominance. There are several conclusions relevant to crop plants in general and to sorghum breeding and biology in particular: (i) heterosis for reproductive (1), vegetative (2) and metabolic phenotypes is predominantly achieved via dominance complementation. (ii) most loci that seems to be inherited as overdominant are in fact achieving superior phenotype of the heterozygous due to linkage in repulsion, namely by pseudooverdominant mechanism. Our computer simulations show that such repulsion linkage could influence QTL detection and estimation of effect in segregating populations. (iii) A new height QTL (qHT7.1) was identified near the genomic region harboring the known auxin transporter Dw3 in sorghum, and its genetic dissection in RIL population demonstrated that it affects both the upper and lower parts of the plant, whereas Dw3 affects only the part below the flag leaf. (iv) HTL mapping for grain nitrogen content in sorghum grains has identified several candidate genes that regulate this trait, including several putative nitrate transporters and a transcription factor belonging to the no-apical meristem (NAC)-like large gene family. This activity was combined with another BARD-funded project in which several de-novo mutants in this gene were identified for functional analysis.
APA, Harvard, Vancouver, ISO, and other styles
8

Weiss, David, and Neil Olszewski. Manipulation of GA Levels and GA Signal Transduction in Anthers to Generate Male Sterility. United States Department of Agriculture, 2000. http://dx.doi.org/10.32747/2000.7580678.bard.

Full text
Abstract:
The original objectives of the research were: i. To study the role of GA in anther development, ii. To manipulate GA and/or GA signal transduction levels in the anthers in order to generate male sterility. iii. To characterize the GA signal transduction repressor, SPY. Previous studies have suggested that gibberellins (GAs) are required for normal anther development. In this work, we studied the role of GA in the regulation of anther development in petunia. When plants were treated with the GA-biosynthesis inhibitor paclobutrazol, anther development was arrested. Microscopic analysis of these anthers revealed that paclobutrazol inhibits post-meiotic developmental processes. The treated anthers contained pollen grains but the connective tissue and tapetum cells were degenerated. The expression of the GA-induced gene, GIP, can be used in petunia as a molecular marker to: study GA responses. Analyses of GIP expression during anther development revealed that the gene is induced only after microsporogenesis. This observation further suggests a role for GA in the regulation of post-meiotic processes during petunia anther development. Spy acts as a negative regulator of gibberellin (GA) action in Arabidopsis. We cloned the petunia Spy homologue, PhSPY, and showed that it can complement the spy-3 mutation in Arabidopsis. Overexpression of Spy in transgenic petunia plants affected various GA-regulated processes, including seed germination, shoot elongation, flower initiation, flower development and the expression of a GA- induced gene, GIP. In addition, anther development was inhibited in the transgenic plants following microsporogenesis. The N-terminus of Spy contains tetratricopeptide repeats (TPR). TPR motifs participate in protein-protein interactions, suggesting that Spy is part of a multiprotein complex. To test this hypothesis, we over-expressed the SPY's TPR region without the catalytic domain in transgenic petunia and generated a dominant- negative Spy mutant. The transgenic seeds were able to germinate on paclobutrazol, suggesting an enhanced GA signal. Overexpression of PhSPY in wild type Arabidopsis did not affect plant stature, morphology or flowering time. Consistent with Spy being an O-GlcNAc transferase (OGT), Spy expressed in insect cells was shown to O-GlcNAc modify itself. Consistent with O-GlcNAc modification playing a role in GA signaling, spy mutants had a reduction in the GlcNAc modification of several proteins. After treatment of the GA deficient, gal mutant, with GA3 the GlcNAc modification of proteins of the same size as those affected in spy mutants exhibited a reduction in GlcNAcylation. GA-induced GlcNAcase may be responsible for this de-GlcNAcylation because, treatment of gal with GA rapidly induced an increase in GlcNAcase activity. Several Arabidopsis proteins that interact with the TPR domain of Spy were identified using yeast two-hybrids screens. One of these proteins was GIGANTEA (GI). Consistent with GI and Spy functioning as a complex in the plant the spy-4 was epistatic to gi. These experiments also demonstrated that, in addition to its role in GA signaling, Spy functions in the light signaling pathways controlling hypocotyl elongation and photoperiodic induction of flowering. A second Arabidopsis OGT, SECRET AGENT (SCA), was discovered. Like SPY, SCA O-GlcNAc modifies itself. Although sca mutants do not exhibit dramatic phenotypes, spy/sca double mutants exhibit male and female gamete and embryo lethality, indicating that Spy and SCA have overlapping functions. These results suggest that O-GlcNAc modification is an essential modification in plants that has a role in multiple signaling pathways.
APA, Harvard, Vancouver, ISO, and other styles
9

Friedman, Haya, Julia Vrebalov, and James Giovannoni. Elucidating the ripening signaling pathway in banana for improved fruit quality, shelf-life and food security. United States Department of Agriculture, October 2014. http://dx.doi.org/10.32747/2014.7594401.bard.

Full text
Abstract:
Background : Banana being a monocot and having distinct peel and pulp tissues is unique among the fleshy fruits and hence can provide a more comprehensive understanding of fruit ripening. Our previous research which translated ripening discoveries from tomato, led to the identification of six banana fruit-associated MADS-box genes, and we confirmed the positive role of MaMADS1/2 in banana ripening. The overall goal was to further elucidate the banana ripening signaling pathway as mediated by MADS-boxtranscriptional regulators. Specific objectives were: 1) characterize transcriptional profiles and quality of MaMADS1/2 repressed fruit; 2) reveal the role of additional MaMADSgenes in ripening; 3) develop a model of fruit MaMADS-box mode of action; and 4) isolate new components of the banana ripening signaling pathway. Major conclusion: The functions of the banana MaMADS1-5 have been examined by complimenting the rinor the TAGL1-suppressed lines of tomato. Only MaMADS5 exhibited partial complementation of TAGL1-suppressed and rinlines, suggesting that while similar genes play corresponding roles in ripening, evolutionary divergence makes heterologous complementation studies challenging. Nevertheless, the partial complementation of tomato TAGL1-surpessed and rinlines with MaMADS5 suggests this gene is likely an important ripening regulator in banana, worthy of further study. RNA-seqtranscriptome analysis during ripening was performed on WT and MaMADS2-suppressed lines revealing additional candidate genes contributing to ripening control mechanisms. In summary, we discovered 39 MaMADS-box genes in addition to homologues of CNR, NOR and HB-1 expressed in banana fruits, and which were shown in tomato to play necessary roles in ripening. For most of these genes the expression in peel and pulp was similar. However, a number of key genes were differentially expressed between these tissues indicating that the regulatory components which are active in peel and pulp include both common and tissue-specific regulatory systems, a distinction as compared to the more uniform tomato fruit pericarp. Because plant hormones are well documented to affect fruit ripening, the expressions of genes within the auxin, gibberellin, abscisic acid, jasmonic acid, salicylic and ethylene signal transduction and synthesis pathways were targeted in our transcriptome analysis. Genes’ expression associated with these pathways generally declined during normal ripening in both peel and pulp, excluding cytokinin and ethylene, and this decline was delayed in MaMADS2-suppressed banana lines. Hence, we suggest that normal MaMADS2 activity promotes the observed downward expression within these non-ethylene pathways (especially in the pulp), thus enabling ripening progression. In contrast, the expressions of ACSand ACOof the ethylene biosynthesis pathway increase in peel and pulp during ripening and are delayed/inhibited in the transgenic bananas, explaining the reduced ethylene production of MaMADS2-suppressed lines. Inferred by the different genes’ expression in peel and pulp of the gibberellins, salicylic acid and cytokinins pathways, it is suggested that hormonal regulation in these tissues is diverse. These results provide important insights into possible avenues of ripening control in the diverse fruit tissues of banana which was not previously revealed in other ripening systems. As such, our transcriptome analysis of WT and ripening delayed banana mutants provides a starting point for further characterization of ripening. In this study we also developed novel evidence that the cytoskeleton may have a positive role in ripening as components of this pathway were down-regulated by MaMADS2 suppression. The mode of cytoskeleton involvement in fruit ripening remains unclear but presents a novel new frontier in ripening investigations. In summary, this project yielded functional understanding of the role and mode of action of MaMADS2 during ripening, pointing to both induction of ethylene and suppression of non-ethylene hormonal singling pathways. Furthermore, our data suggest important roles for cytoskeleton components and MaMADS5 in the overall banana ripening control network. Implications: The project revealed new molecular components/genes involved in banana ripening and refines our understanding of ripening responses in the peel and pulp tissues of this important species. This information is novel as compared to that derived from the more uniform carpel tissues of other highly studied ripening systems including tomato and grape. The work provides specific target genes for potential modification through genetic engineering or for exploration of useful genetic diversity in traditional breeding. The results from the project might point toward improved methods or new treatments to improve banana fruit storage and quality.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Regular graphs' for particular source types:
Journal articles Dissertations / Theses Books
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