Books on the topic 'Graphes de groupes'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 books for your research on the topic 'Graphes de groupes.'
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.
Browse books on a wide variety of disciplines and organise your bibliography correctly.
Kandasamy, W. B. Vasantha. Groups as graphs. Slatina, Judetul Olt, Romania: Editura CuArt, 2009.
Find full textRibes, Luis. Profinite Graphs and Groups. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-61199-0.
Full textEvans, Anthony B. Orthomorphism Graphs of Groups. Berlin, Heidelberg: Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/bfb0092363.
Full textJ, Dunwoody M., ed. Groups acting on graphs. Cambridge [England]: Cambridge University Press, 1989.
Find full textRussell, Susan Jo. Sorting: Groups and graphs. Palo Alto, CA: Dale Seymour Publications, 1990.
Find full textMikov, Aleksandr. Generalized graphs and grammars. ru: INFRA-M Academic Publishing LLC., 2021. http://dx.doi.org/10.12737/1013698.
Full textJassim, Wadhah Saud. Pregroups and graphs of groups. Birmingham: University of Birmingham, 1991.
Find full textCeccherini-Silberstein, Tullio, Maura Salvatori, and Ecaterina Sava-Huss, eds. Groups, Graphs and Random Walks. Cambridge: Cambridge University Press, 2017. http://dx.doi.org/10.1017/9781316576571.
Full textGroups, graphs, and trees: An introduction to the geometry of infinite groups. Cambridge: Cambridge University Press, 2008.
Find full textMeier, John. Groups, graphs, and trees: An introduction to the geometry of infinite groups. Cambridge: Cambridge University Press, 2008.
Find full textWoess, Wolfgang. Random walks on infinite graphs and groups. Cambridge: Cambridge University Press, 2000.
Find full textM, Goldschmidt David, and Stellmacher B, eds. Groups and graphs: New results and methods. Basel: Birkhäuser Verlag, 1985.
Find full textservice), SpringerLink (Online, ed. Discrete Groups, Expanding Graphs and Invariant Measures. Basel: Birkhäuser Basel, 2010.
Find full textLubotzky, Alexander. Discrete Groups, Expanding Graphs and Invariant Measures. Basel: Birkhäuser Basel, 1994. http://dx.doi.org/10.1007/978-3-0346-0332-4.
Full textLubotzky, Alexander. Discrete groups, expanding graphs, and invariant measures. Basel: Birkhäuser, 1994.
Find full textRead, ed. Combinatorial enumeration of groups: graphs and chemical compounds. Berlino: Springer, 1987.
Find full textPólya, George. Combinatorial enumeration of groups, graphs, and chemical compounds. New York: Springer-Verlag, 1987.
Find full textPraeger, Cheryl E. Low rank representations and graphs for sporadic groups. Cambridge [England]: Cambridge University Press, 1997.
Find full textPólya, George. Combinatorial enumeration of groups, graphs, and chemical compounds. New York: Springer-Verlag, 1987.
Find full textPólya, G., and R. C. Read. Combinatorial Enumeration of Groups, Graphs, and Chemical Compounds. New York, NY: Springer New York, 1987. http://dx.doi.org/10.1007/978-1-4612-4664-0.
Full textPraeger, Cheryl E. Low rank representations and graphs for sporadic groups. New York: Cambridge University Press, 1996.
Find full textH, Haemers Willem, and SpringerLink (Online service), eds. Spectra of Graphs. New York, NY: Andries E. Brouwer and Willem H. Haemers, 2012.
Find full textThe classification of minimal graphs with given abelian automorphism group. Providence, R.I., USA: American Mathematical Society, 1985.
Find full textGroup, Waite, ed. The Waite Group's Adobe Photoshop 5 how-to. Indianapolis: SAMS, 1999.
Find full text1937-, Watkins Mark E., ed. Locally finite, planar, edge-transitive graphs. Providence, R.I: American Mathematical Society, 1997.
Find full textSibbet, David. Graphic guide to best team practices. 2nd ed. San Francisco, CA: Graphic Guides, 1992.
Find full textRubin, Matatyahu. The reconstruction of trees from their automorphism groups. Providence, R.I: American Mathematical Society, 1993.
Find full textCherlin, Gregory L. The classification of countable homogeneous directed graphs and countable homogeneous n-tournaments. Providence, R.I: American Mathematical Society, 1998.
Find full text1942-, Knauer U., and Mikhalev A. V, eds. Monoids, acts, and categories: With applications to wreath products and graphs : a handbook for students and researchers. Berlin: W. de Gruyter, 2000.
Find full textDiagram techniques in group theory. Cambridge [England]: Cambridge University Press, 1990.
Find full textFeigl, Friedrich. Friedrich Feigl: [paintings, drawings and graphic art. Prague: Jewish Museum in Prague, 2007.
Find full textTao, Terence. Expansion in finite simple groups of Lie type. Providence, Rhode Island: American Mathematical Society, 2015.
Find full textDavid, Lasky, ed. The Carter Family: Don't forget this song : a graphic novel. New York: Abrams ComicArts, 2010.
Find full textSweet and sour grapes: [the culture of Yankee ingenuity & machine tools]. [Boston, MA]: Aspatore, 2004.
Find full textill, Campbell Sophie, Lee Shawn letterer, Long Tom letterer, and Robbins Robbie letterer, eds. Jem and the Holograms: Showtime. San Diego, CA: Idea & Design Works, LLC, 2015.
Find full textFink, Eugene. Restricted-Orientation Convexity. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004.
Find full text1957-, Steger Tim, ed. Harmonic analysis for anisotropic random walks on homogeneous trees. Providence, R.I: American Mathematical Society, 1994.
Find full textBalashov, Alexander. Russian painting and graphic art: 1920s-1930s : from the collection of UniCredit Bank. Moscow: Knigi WAM, 2008.
Find full textillustrator, Culver Dennis, and Villalobos Ramon 1987 illustrator, eds. Odd Schnozz and the Odd Squad. Portland, OR: Oni Press, 2015.
Find full text