Relevant bibliographies by topics / Circulant graphs

Contents

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

Academic literature on the topic 'Circulant graphs'

Author: Grafiati
Published: 4 June 2021
Last updated: 25 January 2023

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 'Circulant 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 "Circulant graphs"

1

Duong, Linh, Brenda K. Kroschel, Michael Riddell, Kevin N. Vander Meulen, and Adam Van Tuyl. "Maximum nullity and zero forcing of circulant graphs." Special Matrices 8, no. 1 (December 6, 2020): 221–34. http://dx.doi.org/10.1515/spma-2020-0106.

Full text
Abstract:
AbstractThe zero forcing number of a graph has been applied to communication complexity, electrical power grid monitoring, and some inverse eigenvalue problems. It is well-known that the zero forcing number of a graph provides a lower bound on the minimum rank of a graph. In this paper we bound and characterize the zero forcing number of various circulant graphs, including families of bipartite circulants, as well as all cubic circulants. We extend the definition of the Möbius ladder to a type of torus product to obtain bounds on the minimum rank and the maximum nullity on these products. We obtain equality for torus products by employing orthogonal Hankel matrices. In fact, in every circulant graph for which we have determined these numbers, the maximum nullity equals the zero forcing number. It is an open question whether this holds for all circulant graphs.
APA, Harvard, Vancouver, ISO, and other styles
2

Vilfred, V. "A Theory of Cartesian Product and Factorization of Circulant Graphs." Journal of Discrete Mathematics 2013 (December 26, 2013): 1–10. http://dx.doi.org/10.1155/2013/163740.

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

Chia, Gek-Ling, and Chong-Keang Lim. "Counting 2-circulant graphs." Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics 39, no. 2 (October 1985): 270–81. http://dx.doi.org/10.1017/s1446788700022527.

Full text
Abstract:
AbstractAlspach and Sutcliffe call a graph X(S, q, F) 2-circulant if it consists of two isomorphic copies of circulant graphs X(p, S) and X(p, qS) on p vertices with “cross-edges” joining one another in a prescribed manner. In this paper, we enumerate the nonisomorphic classes of 2-circulant graphs X(S, q, F) such that |S| = m and |F| = k. We also determine a necessary and sufficient condition for a 2-circulant graph to be a GRR. The nonisomorphic classes of GRR on 2p vertices are also enumerated.
APA, Harvard, Vancouver, ISO, and other styles
4

THOMSON, ALISON, and SANMING ZHOU. "FROBENIUS CIRCULANT GRAPHS OF VALENCY FOUR." Journal of the Australian Mathematical Society 85, no. 2 (October 2008): 269–82. http://dx.doi.org/10.1017/s1446788708000979.

Full text
Abstract:
AbstractA first kind Frobenius graph is a Cayley graph Cay(K,S) on the Frobenius kernel of a Frobenius group $K \rtimes H$ such that S=aH for some a∈K with 〈aH〉=K, where H is of even order or a is an involution. It is known that such graphs admit ‘perfect’ routing and gossiping schemes. A circulant graph is a Cayley graph on a cyclic group of order at least three. Since circulant graphs are widely used as models for interconnection networks, it is thus highly desirable to characterize those which are Frobenius of the first kind. In this paper we first give such a characterization for connected 4-valent circulant graphs, and then describe optimal routing and gossiping schemes for those which are first kind Frobenius graphs. Examples of such graphs include the 4-valent circulant graph with a given diameter and maximum possible order.
APA, Harvard, Vancouver, ISO, and other styles
5

SAXENA, NITIN, SIMONE SEVERINI, and IGOR E. SHPARLINSKI. "PARAMETERS OF INTEGRAL CIRCULANT GRAPHS AND PERIODIC QUANTUM DYNAMICS." International Journal of Quantum Information 05, no. 03 (June 2007): 417–30. http://dx.doi.org/10.1142/s0219749907002918.

Full text
Abstract:
The intention of the paper is to move a step towards a classification of network topologies that exhibit periodic quantum dynamics. We show that the evolution of a quantum system whose hamiltonian is identical to the adjacency matrix of a circulant graph is periodic if and only if all eigenvalues of the graph are integers (that is, the graph is integral). Motivated by this observation, we focus on relevant properties of integral circulant graphs. Specifically, we bound the number of vertices of integral circulant graphs in terms of their degree, characterize bipartiteness and give exact bounds for their diameter. Additionally, we prove that circulant graphs with odd order do not allow perfect state transfer.
APA, Harvard, Vancouver, ISO, and other styles
6

Rodríguez, José M., and José M. Sigarreta. "The hyperbolicity constant of infinite circulant graphs." Open Mathematics 15, no. 1 (June 9, 2017): 800–814. http://dx.doi.org/10.1515/math-2017-0061.

Full text
Abstract:
Abstract If X is a geodesic metric space and x1, x2, x3 ∈ X, a geodesic triangle T = {x1, x2, x3} is the union of the three geodesics [x1x2], [x2x3] and [x3x1] in X. The space X is δ-hyperbolic (in the Gromov sense) if any side of T is contained in a δ-neighborhood of the union of the two other sides, for every geodesic triangle T in X. Deciding whether or not a graph is hyperbolic is usually very difficult; therefore, it is interesting to find classes of graphs which are hyperbolic. A graph is circulant if it has a cyclic group of automorphisms that includes an automorphism taking any vertex to any other vertex. In this paper we prove that infinite circulant graphs and their complements are hyperbolic. Furthermore, we obtain several sharp inequalities for the hyperbolicity constant of a large class of infinite circulant graphs and the precise value of the hyperbolicity constant of many circulant graphs. Besides, we give sharp bounds for the hyperbolicity constant of the complement of every infinite circulant graph.
APA, Harvard, Vancouver, ISO, and other styles
7

Angeles-Canul, R. J., R. M. Norton, M. C. Opperman, C. C. Paribello, M. C. Russell, and C. Tamon. "Perfect state transfer, integral circulants, and join of graphs." Quantum Information and Computation 10, no. 3&4 (March 2010): 325–42. http://dx.doi.org/10.26421/qic10.3-4-10.

Full text
Abstract:
We propose new families of graphs which exhibit quantum perfect state transfer. Our constructions are based on the join operator on graphs, its circulant generalizations, and the Cartesian product of graphs. We build upon the results of Ba\v{s}i\'{c} and Petkovi\'{c} ({\em Applied Mathematics Letters} {\bf 22}(10):1609-1615, 2009) and construct new integral circulants and regular graphs with perfect state transfer. More specifically, we show that the integral circulant $\textsc{ICG}_{n}(\{2,n/2^{b}\} \cup Q)$ has perfect state transfer, where $b \in \{1,2\}$, $n$ is a multiple of $16$ and $Q$ is a subset of the odd divisors of $n$. Using the standard join of graphs, we also show a family of double-cone graphs which are non-periodic but exhibit perfect state transfer. This class of graphs is constructed by simply taking the join of the empty two-vertex graph with a specific class of regular graphs. This answers a question posed by Godsil (arxiv.org math/08062074).
APA, Harvard, Vancouver, ISO, and other styles
8

El-Mesady, Ahmed, Aleksandr Y. Romanov, Aleksandr A. Amerikanov, and Alexander D. Ivannikov. "On Bipartite Circulant Graph Decompositions Based on Cartesian and Tensor Products with Novel Topologies and Deadlock-Free Routing." Algorithms 16, no. 1 (December 22, 2022): 10. http://dx.doi.org/10.3390/a16010010.

Full text
Abstract:
Recent developments in commutative algebra, linear algebra, and graph theory allow us to approach various issues in several fields. Circulant graphs now have a wider range of practical uses, including as the foundation for optical networks, discrete cellular neural networks, small-world networks, models of chemical reactions, supercomputing and multiprocessor systems. Herein, we are concerned with the decompositions of the bipartite circulant graphs. We propose the Cartesian and tensor product approaches as helping tools for the decompositions. The proposed approaches enable us to decompose the bipartite circulant graphs into many categories of graphs. We consider the use cases of applying the described theory of bipartite circulant graph decomposition to the problems of finding new topologies and deadlock-free routing in them when building supercomputers and networks-on-chip.
APA, Harvard, Vancouver, ISO, and other styles
9

Triyani, Triyani, Mashuri Mashuri, Bunga Tirai Anarkis, and Slamet Riyadi. "The spectrum on prism graph using circulant matrix." Bulletin of Applied Mathematics and Mathematics Education 2, no. 1 (May 18, 2022): 1–10. http://dx.doi.org/10.12928/bamme.v2i1.5129.

Full text
Abstract:
Spectral graph theory discusses about the algebraic properties of graphs based on the spectrum of a graph. This article investigated the spectrum of prism graph. The method used in this research is the circulant matrix. The results showed that prism graph P2,s is a regular graph of degree 3, for s odd and s ≥ 3, P2,s is a circulantt graph with regular spectrum.
APA, Harvard, Vancouver, ISO, and other styles
10

Zhou, Houqing. "The Wiener Index of Circulant Graphs." Journal of Chemistry 2014 (2014): 1–4. http://dx.doi.org/10.1155/2014/742121.

Full text
Abstract:
Circulant graphs are an important class of interconnection networks in parallel and distributed computing. In this paper, we discuss the relation of the Wiener index and the Harary index of circulant graphs and the largest eigenvalues of distance matrix and reciprocal distance matrix of circulants. We obtain the following consequence:W/λ=H/μ;2W/n=λ;2H/n=μ, whereW,Hdenote the Wiener index and the Harary index andλ,μdenote the largest eigenvalues of distance matrix and reciprocal distance matrix of circulant graphs, respectively. Moreover we also discuss the Wiener index of nonregular graphs with cut edges.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Circulant graphs"

1

Kotzagiannidis, Madeleine S. "From spline wavelet to sampling theory on circulant graphs and beyond : conceiving sparsity in graph signal processing." Thesis, Imperial College London, 2017. http://hdl.handle.net/10044/1/56614.

Full text
Abstract:
Graph Signal Processing (GSP), as the field concerned with the extension of classical signal processing concepts to the graph domain, is still at the beginning on the path toward providing a generalized theory of signal processing. As such, this thesis aspires to conceive the theory of sparse representations on graphs by traversing the cornerstones of wavelet and sampling theory on graphs. Beginning with the novel topic of graph spline wavelet theory, we introduce families of spline and e-spline wavelets, and associated filterbanks on circulant graphs, which lever- age an inherent vanishing moment property of circulant graph Laplacian matrices (and their parameterized generalizations), for the reproduction and annihilation of (exponen- tial) polynomial signals. Further, these families are shown to provide a stepping stone to generalized graph wavelet designs with adaptive (annihilation) properties. Circulant graphs, which serve as building blocks, facilitate intuitively equivalent signal processing concepts and operations, such that insights can be leveraged for and extended to more complex scenarios, including arbitrary undirected graphs, time-varying graphs, as well as associated signals with space- and time-variant properties, all the while retaining the focus on inducing sparse representations. Further, we shift from sparsity-inducing to sparsity-leveraging theory and present a novel sampling and graph coarsening framework for (wavelet-)sparse graph signals, inspired by Finite Rate of Innovation (FRI) theory and directly building upon (graph) spline wavelet theory. At its core, the introduced Graph-FRI-framework states that any K-sparse signal residing on the vertices of a circulant graph can be sampled and perfectly reconstructed from its dimensionality-reduced graph spectral representation of minimum size 2K, while the structure of an associated coarsened graph is simultaneously inferred. Extensions to arbitrary graphs can be enforced via suitable approximation schemes. Eventually, gained insights are unified in a graph-based image approximation framework which further leverages graph partitioning and re-labelling techniques for a maximally sparse graph wavelet representation.
APA, Harvard, Vancouver, ISO, and other styles
2

Parshina, Olga. "Structures périodiques en mots morphiques et en colorations de graphes circulants infinis." Thesis, Lyon, 2019. http://www.theses.fr/2019LYSE1071/document.

Full text
Abstract:
Cette thèse est composée de deux parties : l’une traite des propriétés combinatoires de mots infinis et l’autre des problèmes de colorations des graphes.La première partie du manuscrit concerne les structures régulières dans les mots apériodiques infinis, à savoir les sous-séquences arithmétiques et les premiers retours complets.Nous étudions la fonction qui donne la longueur maximale d’une sous-séquence arithmétique monochromatique (une progression arithmétique) en fonction de la différence commune d pour une famille de mots morphiques uniformes, qui inclut le mot de Thue-Morse. Nous obtenons la limite supérieure explicite du taux de croissance de la fonction et des emplacements des progressions arithmétiques de longueurs maximales et de différences d. Pour étudier des sous-séquences arithmétiques périodiques dans des mots infinis, nous définissons la notion d'indice arithmétique et obtenons des bornes supérieures et inférieures sur le taux de croissance de la fonction donnant l’indice arithmétique dans la même famille de mots.Dans la même veine, une autre question concerne l’étude de deux nouvelles fonctions de complexité de mots infinis basées sur les notions de mots ouverts et fermés. Nous dérivons des formules explicites pour les fonctions de complexité ouverte et fermée pour un mot d'Arnoux-Rauzy sur un alphabet de cardinalité finie.La seconde partie de la thèse traite des colorations parfaites (des partitions équitables) de graphes infinis de degré borné. Nous étudions les graphes de Caley de groupes additifs infinis avec un ensemble de générateurs fixé. Nous considérons le cas où l'ensemble des générateurs est composé d'entiers de l'intervalle [-n, n], et le cas où les générateurs sont des entiers impairs de [-2n-1, 2n+1], où n est un entier positif. Pour les deux familles de graphes, nous obtenons une caractérisation complète des colorations parfaites à deux couleurs
The content of the thesis is comprised of two parts: one deals with combinatorial properties of infinite words and the other with graph coloring problems.The first main part of the manuscript concerns regular structures in infinite aperiodic words, such as arithmetic subsequences and complete first returns.We study the function that outputs the maximal length of a monochromatic arithmetic subsequence (an arithmetic progression) as a function of the common difference d for a family of uniform morphic words, which includes the Thue-Morse word. We obtain the explicit upper bound on the rate of growth of the function and locations of arithmetic progressions of maximal lengths and difference d. To study periodic arithmetic subsequences in infinite words we define the notion of an arithmetic index and obtain upper and lower bounds on the rate of growth of the function of arithmetic index in the same family of words.Another topic in this direction involves the study of two new complexity functions of infinite words based on the notions of open and closed words. We derive explicit formulae for the open and closed complexity functions for an Arnoux-Rauzy word over an alphabet of finite cardinality.The second main part of the thesis deals with perfect colorings (a.k.a. equitable partitions) of infinite graphs of bounded degree. We study Caley graphs of infinite additive groups with a prescribed set of generators. We consider the case when the set of generators is composed of integers from the interval [-n,n], and the case when the generators are odd integers from [-2n-1,2n+1], where n is a positive integer. For both families of graphs, we obtain a complete characterization of perfect 2-colorings
APA, Harvard, Vancouver, ISO, and other styles
3

Roussel, Nicolas. "Circular coloring and acyclic choosability of graphs." Thesis, Bordeaux 1, 2009. http://www.theses.fr/2009BOR13889/document.

Full text
Abstract:
Dans cette thèse, nous nous intéressons à la coloration circulaire des graphes planaires. Des bornes supérieures ont été données pour des graphes avec degré maximum borné, avec girth, la longueur de son plus petit cycle, bornée, avec des cycles manquants, etc. Ici nous donnerons de nouvelles bornes pour les graphes avec degré moyen maximum borné. Nous étudions également la coloration totale et la coloration (d,1)-totale de plusieurs familles infinies de graphes. Nous décrivons le nouveau concept de coloration (d,1)-totale circulaire. Enfin, nous discutons les conditions nécessaires pour qu'un graphe planaire admette une coloration acyclique par listes de taille 4
In this thesis, we study the circular coloring of planar graphs. Upper bounds have been given for graphs with bounded maximum degree, with bounded girth, that is the length of its smallest cycle, with missing cycles, and so on. It has also been studied for graphs with bounded maximum average degree. Here we give new upper bounds for that latter case. We also study the total coloring and ($d,1$)-total labeling of a few infinite families of graphs and describe the new concept of circular ($d,1$)-total labeling of graphs. In the last part, we will discuss conditions for a planar graph to be acyclically $4$-choosable
APA, Harvard, Vancouver, ISO, and other styles
4

Pêcher, Arnaud. "Des multiples facettes des graphes circulants." Habilitation à diriger des recherches, Université Sciences et Technologies - Bordeaux I, 2008. http://tel.archives-ouvertes.fr/tel-00332976.

Full text
Abstract:
Ce document présente une vue synthétique de mes travaux de recherche menés ces cinq dernières années, au sein du LaBRI.
Les activités de recherche d'un enseignant-chercheur ne s'inscrivent pas souvent dans un plan de recherche soigneusement pensé. Elles évoluent en fonction de multiples impondérables, dont notamment les rencontres avec d'autres chercheurs ou encore les opportunités ``stratégiques'' de financement. De ce fait, il n'est pas toujours facile de dégager un fil conducteur qui permette de regrouper un ensemble des résultats obtenus ``au fil de l'eau'' sans avoir recours à des raccourcis un peu ``artificiels''.

Lorsque je me suis efforcé de dégager un point commun à mes travaux, je me suis aperçu que des objets mathématiques bien particuliers n'étaient jamais très loin de mes activités: les groupes cycliques finis. En creusant un peu plus cette perception, il m'est apparu que mes travaux accordent une place considérable à des graphes élémentaires associés aux groupes cycliques, dits graphes ou encore webs.

Ce document est donc consacré à la mise en valeur des multiples facettes de ces graphes. ``Facettes'' est ici à double sens, puisqu'une partie conséquente de mes résultats est précisément dédiée à la détermination des facettes de certains polytopes associés aux graphes!

Sur la forme, les preuves ont été omises afin d'alléger le texte, à l'exception de quelques preuves sélectionnées pour leur brièveté et pour la pertinence du résultat qu'elles procurent. Des hyperliens pointent vers la version anglaise des preuves manquantes, telles qu'elles figurent dans le recueil d'articles en annexe. Pour faciliter également la lecture, l'index à la fin de l'ouvrage redonne toutes les principales définitions.

Sur le fond, ce document est structuré de la manière suivante.

Le premier chapitre est consacré aux principaux résultats connus sur les graphes parfaits. Ceci permet de définir les objets mathématiques utilisés par la suite, et de rappeler l'extraordinaire richesse conceptuelle des graphes parfaits.

Dans le second chapitre, nous abordons un raffinement de la coloration usuelles des graphes, appelé ``coloration circulaire''. Cette coloration est à l'origine d'une généralisation récente des graphes parfaits: les ``graphes circulaires-parfaits''. Nous étudions la possibilité d'une caractérisation analogue à celles des graphes parfaits, que ce soit par sous-graphes exclus ou bien polyédrale.

Dans le troisième chapitre, nous nous intéressons à une généralisation naturelle des webs: ``les graphes quasi-adjoints''. Il s'agit d'une sous-famille des graphes sans griffe, et à ce titre, l'étude de leur polytope des stables est de première importance.

Dans le quatrième chapitre, nous menons des investigations directes sur le polytope des stables des graphes sans griffe.

La conclusion est donnée dans le dernier et cinquième chapitre, qui contient également une brève présentation de quelques résultats préliminaires quant au calcul en temps polynomial du nombre circulaire-chromatique des graphes circulaires-parfaits et au calcul du nombre de stabilité des graphes quasi-adjoints. Tout repose sur l'introduction d'un nouveau polytope construit à partir des webs ...
APA, Harvard, Vancouver, ISO, and other styles
5

Schubert, Michael [Verfasser]. "Circular flows on signed graphs / Michael Schubert." Paderborn : Universitätsbibliothek, 2018. http://d-nb.info/1161798684/34.

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

Micheneau, Cyrille. "Graphes récursifs circulants, communications vagabondes et simulation." Bordeaux 1, 1996. http://www.theses.fr/1996BOR10678.

Full text
Abstract:
Le domaine des graphes et reseaux d'interconnexion se propose d'etudier les problemes de communications dans les machines paralleles. La premiere partie de cette these est une etude complete des graphes recursifs circulants g(cdm,d). Nous commencons par une etude structurelle de ces graphes (proprietes, diametre, construction recursive). Nous decomposons ensuite ces graphes en cycles hamiltoniens arete-disjoints. Puis, nous donnons un algorithme de construction d'arbres arcs-disjoints dans le temps pour effectuer un echange total en temps optimal selon le protocole delta-port, temps constant. Dans une seconde partie, nous nous interessons a la diffusion vagabonde et a l'echange total vagabond dans quelques graphes (chemin, cycle, arbres d-aires complets et hypercubes). Nous donnons des bornes maximales pour les temps necessaires a l'execution de ces schemas de communication, et des algorithmes atteignant ces bornes. Ce nouveau modele introduit en 1993, est adapte a des machines paralleles dont les routeurs auraient pas ou peu de memoire locale. Dans la troisieme partie de ce document, nous presentons notre realisation logicielle, griap, destinee a la validation de schemas de communication. Griap se compose de differents modules permettant de generer les listes d'adjacences de familles de graphes, de simuler l'execution de schemas de diffusion ou du routage intensif en modele hot potato. Une interface graphique a ete adaptee pour interpreter facilement la grande quantite d'informations emanant d'une simulation
APA, Harvard, Vancouver, ISO, and other styles
7

Holt, Tracy Lance. "On the Attainability of Upper Bounds for the Circular Chromatic Number of K4-Minor-Free Graphs." Digital Commons @ East Tennessee State University, 2008. https://dc.etsu.edu/etd/1916.

Full text
Abstract:
Let G be a graph. For k ≥ d ≥ 1, a k/d -coloring of G is a coloring c of vertices of G with colors 0, 1, 2, . . ., k - 1, such that d ≤ | c(x) - c(y) | ≤ k - d, whenever xy is an edge of G. We say that the circular chromatic number of G, denoted χc(G), is equal to the smallest k/d where a k/d -coloring exists. In [6], Pan and Zhu have given a function μ(g) that gives an upper bound for the circular-chromatic number for every K4-minor-free graph Gg of odd girth at least g, g ≥ 3. In [7], they have shown that their upper bound in [6] can not be improved by constructing a sequence of graphs approaching μ(g) asymptotically. We prove that for every odd integer g = 2k + 1, there exists a graph Gg ∈ G/K4 of odd girth g such that χc(Gg) = μ(g) if and only if k is not divisible by 3. In other words, for any odd g, the question of attainability of μ(g) is answered for all g by our results. Furthermore, the proofs [6] and [7] are long and tedious. We give simpler proofs for both of their results.
APA, Harvard, Vancouver, ISO, and other styles
8

Zacharopoulos, Panagiotis [Verfasser]. "Asymmetric game perfect graphs and the circular coloring game of weighted graphs / Panagiotis Zacharopoulos. Fakultät für Mathematik." Bielefeld : Universitätsbibliothek Bielefeld, Hochschulschriften, 2012. http://d-nb.info/1024640639/34.

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

Lin, Wensong. "Circular chromatic numbers and distance two labelling numbers of graphs." HKBU Institutional Repository, 2004. http://repository.hkbu.edu.hk/etd_ra/591.

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

Wooten, Trina Marcella. "Finding Edge and Vertex Induced Cycles within Circulants." Digital Commons @ East Tennessee State University, 2008. https://dc.etsu.edu/etd/1985.

Full text
Abstract:
Let H be a graph. G is a subgraph of H if V (G) ⊆ V (H) and E(G) ⊆ E(H). The subgraphs of H can be used to determine whether H is planar, a line graph, and to give information about the chromatic number. In a recent work by Beeler and Jamison [3], it was shown that it is difficult to obtain an automorphic decomposition of a triangle-free graph. As many of their examples involve circulant graphs, it is of particular interest to find triangle-free subgraphs within circulants. As a cycle with at least four vertices is a canonical example of a triangle-free subgraph, we concentrate our efforts on these. In this thesis, we will state necessary and sufficient conditions for the existence of edge induced and vertex induced cycles within circulants.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Circulant graphs"

1

Daly, Charles J. Scalar diffraction from a circular aperture. Boston: Kluwer Academic, 2000.

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

Great Britain. Colonial Office. [Circular]: The following extracts of a circular despatch, from the Secretary of State for the colonies, is published for the information of military settlers ... [London: s.n., 2002.

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

Wood, Venita M. Auditing recipients of federal awards: Practical guidance for applying OMB circular A-133. 3rd ed. New York, NY: American Institute of Certified Public Accountants, 2005.

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

Moraglio, Joseph F. Auditing recipients of federal awards: Practical guidance for applying OMB circular A-133, Audits of states, local governments, and non-profit organizations. 2nd ed. New York, NY: American Institute of Certified Public Accountants, 2001.

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

Moraglio, Joseph F. Auditing recipients of federal awards: Practical guidance for applying OMB circular A-133, Audits of states, local governments, and non-profit organizations : practice aids. 2nd ed. New York, NY: American Institute of Certified Public Accountants, 2001.

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

United States. Dept. of Health and Human Services, ed. A guide for state, local, and Indian tribal governments: Cost principles and procedures for developing cost allocation plans and indirect cost rates for agreements with the federal government : implementation guide for Office of Management and Budget circular A-87. Washington, DC: U.S. Dept. of Health and Human Services, 1997.

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

Accounts, Alabama Dept of Examiners of Public. Report on the audits of the general purpose financial statements and report on the single audit of Federal financial assistance programs performed in accordance with the Single Audit Act of 1984 (Public law 98-502) and U.S. Office of Management and Budget circular A-128, October 1, 1992 through September 30, 1994. Montgomery, Ala: State of Alabama, Dept. of Examiners of Public Accounts, 1995.

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

Alabama. Dept. of Examiners of Public Accounts. Report on the audits of the general purpose financial statements and report on the single audit of Federal financial assistance programs performed in accordance with the Single Audit Act of 1984 (Public law 98-502) and U.S. Office of Management and Budget circular A-128, October 1, 1990 through September 30, 1992. Montgomery, Ala: State of Alabama, Dept. of Examiners of Public Accounts, 1994.

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

Circular Functions and Graphs (Lifepac Math Grade 12-Trigonometry). Alpha Omega Publications (AZ), 2001.

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

Press, Inventive. Circle Grid Graph Paper: Graphing Paper for Circular and Decorative Designs. Independently Published, 2019.

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

Book chapters on the topic "Circulant graphs"

1

Harnau, W., and D. Jordan. "Longest Cycles in Circulant Graphs." In Topics in Combinatorics and Graph Theory, 331–38. Heidelberg: Physica-Verlag HD, 1990. http://dx.doi.org/10.1007/978-3-642-46908-4_37.

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

Cai, Jin-Yi, George Havas, Bernard Mans, Ajay Nerurkar, Jean-Pierre Seifert, and Igor Shparlinski. "On Routing in Circulant Graphs." In Lecture Notes in Computer Science, 360–69. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-48686-0_36.

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

Antony, Toby B., and Sudev Naduvath. "On Circulant Completion of Graphs." In Data Science and Security, 181–88. Singapore: Springer Nature Singapore, 2022. http://dx.doi.org/10.1007/978-981-19-2211-4_15.

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

Manuel, Paul, Indra Rajasingh, Bharati Rajan, and Joice Punitha. "Kernel in Oriented Circulant Graphs." In Lecture Notes in Computer Science, 396–407. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-10217-2_39.

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

Mans, Bernard, and Igor Shparlinski. "Bisecting and Gossiping in Circulant Graphs." In LATIN 2004: Theoretical Informatics, 589–98. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24698-5_61.

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

Zhou, Houqing. "On Self-complementary of Circulant Graphs." In Communications in Computer and Information Science, 464–71. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-24999-0_64.

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

Mans, Bernard, Francesco Pappalardi, and Igor Shparlinski. "On the Ádám Conjecture on Circulant Graphs." In Lecture Notes in Computer Science, 251–60. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/3-540-68535-9_29.

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

Cohen, Johanne, Pierre Fraigniaud, and Cyril Gavoille. "Recognizing Bipartite Incident-Graphs of Circulant Digraphs." In Graph-Theoretic Concepts in Computer Science, 215–27. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-46784-x_22.

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

Mans, Bernard, and Igor E. Shparlinski. "Random Walks and Bisections in Random Circulant Graphs." In LATIN 2012: Theoretical Informatics, 542–55. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-29344-3_46.

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

Leão, Rodrigo S. C., and Valmir C. Barbosa. "Minimal Chordal Sense of Direction and Circulant Graphs." In Lecture Notes in Computer Science, 670–80. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11821069_58.

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

Conference papers on the topic "Circulant graphs"

1

Costa, S. I. R., J. E. Strapasson, R. M. Siqueira, and M. Muniz. "Circulant graphs and spherical codes." In 2006 International Telecommunications Symposium. IEEE, 2006. http://dx.doi.org/10.1109/its.2006.4433239.

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

Kotzagiannidis, Madeleine S., and Pier Luigi Dragotti. "Higher-order graph wavelets and sparsity on circulant graphs." In SPIE Optical Engineering + Applications, edited by Manos Papadakis, Vivek K. Goyal, and Dimitri Van De Ville. SPIE, 2015. http://dx.doi.org/10.1117/12.2192003.

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

Zhou, Houqing. "The algebraic connectivity of circulant graphs." In 2012 2nd International Conference on Applied Robotics for the Power Industry (CARPI 2012). IEEE, 2012. http://dx.doi.org/10.1109/carpi.2012.6356451.

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

Narayankar, Kishori P., Denzil Jason Saldanha, and John Sherra. "Unique metro domination of circulant graphs." In INTERNATIONAL CONFERENCE ON ADVANCES IN MULTI-DISCIPLINARY SCIENCES AND ENGINEERING RESEARCH: ICAMSER-2021. AIP Publishing, 2022. http://dx.doi.org/10.1063/5.0095177.

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

Kotzagiannidis, Madeleine S., and Pier Luigi Dragotti. "Sparse graph signal reconstruction and image processing on circulant graphs." In 2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP). IEEE, 2014. http://dx.doi.org/10.1109/globalsip.2014.7032255.

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

Gao, Hong, Wei Duan, Tingting Feng, and Yuansheng Yang. "Signed Mixed Domination Number of Circulant Graphs." In 2019 International Conference on Electronic Engineering and Informatics (EEI). IEEE, 2019. http://dx.doi.org/10.1109/eei48997.2019.00113.

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

Liancheng Xu, Liancheng Xu, Zunquan Xia, and Yuansheng Yang. "On the independence number of circulant graphs." In 2nd International Symposium on Information Technologies and Applications in Education (ISITAE 2008). IEE, 2008. http://dx.doi.org/10.1049/ic:20080290.

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

Alves Junior, Mauro N., and Diana Sasaki. "A result on total coloring of circulant graphs." In Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2020. http://dx.doi.org/10.5753/etc.2020.11095.

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

Donno, Alfredo, and Donatella Iacono. "Distances and isomorphisms in 4-regular circulant graphs." In INTERNATIONAL CONFERENCE OF NUMERICAL ANALYSIS AND APPLIED MATHEMATICS 2015 (ICNAAM 2015). Author(s), 2016. http://dx.doi.org/10.1063/1.4952041.

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

Kotzagiannidis, Madeleine S., and Pier Luigi Dragotti. "The graph FRI framework-spline wavelet theory and sampling on circulant graphs." In 2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2016. http://dx.doi.org/10.1109/icassp.2016.7472904.

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

Reports on the topic "Circulant graphs"

1

Palmborg, Cecilia. Fertilization with digestate and digestate products – availability and demonstration experiments within the project Botnia nutrient recycling. Department of Agricultural Research for Northern Sweden, Swedish University of Agricultural Sciences, 2022. http://dx.doi.org/10.54612/a.25rctaeopn.

Full text
Abstract:
To increase our food security in Västerbotten we will need to become more self-sufficient of both energy, feed and nutrients that are now imported to the region. Biogas production from different waste streams is one solution to this. Biogas is produced using biowaste or sewage sludge as substrate in the major cities Umeå and Skellefteå. Biogas systems offer a range of benefits to society. Biogas production is currently prized for its climate benefits when replacing fossil fuels for the production of heat, electricity and vehicle gas, but at Bothnia Nutrient Recycling we have studied how to use the digestate, i.e. the residual product of production, as fertilizer in agriculture. We have been working to improve profitability for biogas producers and develop sustainable products from recycled nutrients, like phosphorus and nitrogen. Improving the uses for digestate increases self-sufficiency in agriculture and contributes to a circular economy. We conducted three agricultural demonstration experiments in collaboration with agricultural high schools in Finland and Sweden to introduce digestate and digestate products to the future farmers in the regions. We found that it may be possible to replace cattle slurry with compost when growing maize despite the low levels of nitrogen, N, available to plants in the compost. In barley, NPK fertilizers gave the highest yield. Digestate from HEMAB and sludge biochar supplemented with recycled ammonium sulphate gave a smaller yield but higher than unfertilized crop. Digestate from a dry digestion biogas plant in Härnösand was better suited to barley than to grass because in an experiment on grass ley the viscous fertilizer did not penetrate the grass and did not increase the growth of the grass. Fertilizer effects on crop quality were small. There was no increased uptake of heavy metals in barley after fertilization with digestate or digestate products compared to NPK fertilization. These demonstration experiments show that more thorough scientific experimentation is needed as a foundation for recommendations to farmers. The amounts of nitrogen and phosphorous in digestate from Västerbotten that could become used as fertilizer were modelled. It showed that if sewage sludge digestate is used to make sludge biochar and ammonium sulphate and the other available digestates are used directly in agriculture, the entire phosphorous demand but only a small part of the nitrogen demand in the county, could be covered. Thus, to achieve a true circular food production, development and increase of both the waste handling sector and agriculture is needed.
APA, Harvard, Vancouver, ISO, and other styles
2

STUDY OF IINTIAL IMPERFECTION OF CONCRETE-FILLED CIRCULAR STEEL TUBE COLUMNS FOR DIRECT ANALYSIS (ICASS’2020). The Hong Kong Institute of Steel Construction, August 2022. http://dx.doi.org/10.18057/icass2020.p.364.

Full text
Abstract:
The initial imperfection and residual stress play important roles in the buckling resistance of both structural system and structural members. The latest Standard for Design of Steel Structures (GB50017-2017) firstly introduces the direct analysis method for the stability design of steel structures in China. The equivalent initial imperfections for steel members have been well specified in this code. However, as an important part of modern structures, there is limited research on the initial imperfections of steel-concrete composite members in relevant regulations in China. Therefore, it is urgent to study the equivalent initial imperfections of steel-concrete members for direct analysis. This paper collects extensive experimental data on concrete-filled circular steel tube columns (CFCSTC) for calibration of finite element models using software ABAQUS. The key factors affecting CFCSTC’s behaviors such as section dimensions, grades of steel and concrete, and width-to-thickness ratios have been taken into account. A comparative analysis for the CFCSTC with and without initial imperfections will be presented. From this study, the equivalent initial imperfection for CFCSTCs will be proposed for practical direct analysis of steel-concrete composite structures to achieve a safer and economical design without use of conventional effective length method.
APA, Harvard, Vancouver, ISO, and other styles
3

PERFORMANCE EVALUATION OF INNOVATIVE COCONUT PALM STEM SHAPED STUD SHEAR CONNECTOR FOR COMPOSITE STRUCTURES. The Hong Kong Institute of Steel Construction, December 2022. http://dx.doi.org/10.18057/ijasc.2022.18.4.4.

Full text
Abstract:
Headed studs are the more frequently employable shear connectors in composite structures. Despite its prevalence, this connector has exhibited remarkable drawbacks, prominently the shear failure at the bottom of the shank. In this research, three novel coconut palm stem (CPS) shaped studs are proposed for composite constructions, aiming to improve the shear capacity and slip performance of the connection. The traditional circular headed stud (CHS) geometry has been restructured to a proposed CPS-shaped stud while maintaining total steel material volume to be the same. Pushout tests were experimentally performed on CHS and CPS-shaped shear connectors to investigate their performance evaluation for ultimate strength, stiffness, ductility, and failure mode. Moreover, the Abaqus/Explicit has been employed to model a pushout specimen. A proposed finite element model was successfully validated with the test results for further parametric analysis. Two distinct grades of concrete and three CPS shapes were considered for the parametric investigation. Finally, three formulas were developed and proposed to predict the shear capacity of the CPS-shaped stud. The performance of the CHS and CPS-shaped stud connections was compared, revealing that the proposed CPS-shaped studs offer 37 to 47% higher shear strength, double stiffness, and slip with better ductility. So, CPS-shaped stud may substitute the traditional headed stud shear connectors in steel-concrete composite structures with added strength, stiffness, and ductility.
APA, Harvard, Vancouver, ISO, and other styles
4

Exploring the Prospects of Using 3D Printing Technology in the South African Human Settlements. Academy of Science of South Africa (ASSAf), 2021. http://dx.doi.org/10.17159/assaf.2021/0074.

Full text
Abstract:
South Africa is a country with significant socio-economic development challenges, with the majority of South Africans having limited or non-existent access to basic infrastructure, services, housing and socio-economic opportunities etc. The urban housing backlog currently exceeds 2.4 million houses, with many families living in informal settlements. The Breaking New Grounds Policy, 2014 for the creation of sustainable human settlements, acknowledges the challenges facing human settlements, such as, decreasing human settlements grants allocation, increasing housing backlog, mushrooming of informal settlements and urbanisation. The White Paper on Science, Technology and Innovation (STI), 2019 notes that South Africa has not yet fully benefited from the potential of STI in addressing the socio-economic challenges and seeks to support the circular economy principles which entail a systematic change of moving to a zero or low waste resource-efficient society. Further to this, the Science and Technology Roadmap’s intention is to unlock the potential of South Africa’s human settlements for a decent standard of living through the smart uptake of science, technology and innovation. One such novel technology is the Three-Dimensional (3D) printing technology, which has produced numerous incredible structures around the world. 3D printing is a computer-controlled industrial manufacturing process which encompasses additive means of production to create 3D shapes. The effects of such a technology have a potential to change the world we live in and could subsequently pave the roadmap to improve on housing delivery and reduce the negative effects of conventional construction methods on the environment. To this end, the Academy of Science of South Africa (ASSAf), in partnership with the Department of Science and Innovation (DSI) and the University of Johannesburg (UJ) hosted the second virtual IID seminar titled: Exploring the Prospects of Using 3D Printing Technology in the South African Human Settlements, on 01 March 2021 to explore the potential use of 3D printing technology in human settlements. The webinar presented preliminary findings from a study conducted by UJ, addressing the following topics: 1. The viability of 3D printing technology 2. Cost comparison of 3D printed house to conventional construction 3. Preliminary perceptions on 3D printing of houses Speakers included: Dr Jennifer Mirembe (NDoHS), Dr Jeffrey Mahachi, Mr Refilwe Lediga, Mr Khululekani Ntakana and Dr Luxien Ariyan, all from UJ. There was a unanimous consensus that collaborative efforts from all stakeholders are key to take advantage of this niche technology. @ASSAf_Official; @dsigovza; @go2uj; @The_DHS; #SA 3D_Printing; #3D Print_Housing; #IID
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Circulant 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