Log in

Relevant bibliographies by topics / Complete Multipartite

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers

Academic literature on the topic 'Complete Multipartite'

Author: Grafiati

Published: 4 June 2021

Last updated: 3 February 2022

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

Select a source type:

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

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 "Complete Multipartite"

1

Bapat, Ravindra B., and Masoud Karimi. "Integral complete multipartite graphs." Linear Algebra and its Applications 549 (July 2018): 1–11. http://dx.doi.org/10.1016/j.laa.2018.03.026.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Wang, Ligong, and Xiaodong Liu. "Integral complete multipartite graphs." Discrete Mathematics 308, no. 17 (2008): 3860–70. http://dx.doi.org/10.1016/j.disc.2007.07.084.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Oboudi, Mohammad Reza. "Seidel energy of complete multipartite graphs." Special Matrices 9, no. 1 (2021): 212–16. http://dx.doi.org/10.1515/spma-2020-0131.

Full text

Abstract:

Abstract The Seidel energy of a simple graph G is the sum of the absolute values of the eigenvalues of the Seidel matrix of G. In this paper we study the Seidel eigenvalues of complete multipartite graphs and find the exact value of the Seidel energy of the complete multipartite graphs.

APA, Harvard, Vancouver, ISO, and other styles

4

Cameron, Peter J. "Decompositions of complete multipartite graphs." Discrete Mathematics 309, no. 12 (2009): 4185–86. http://dx.doi.org/10.1016/j.disc.2008.10.021.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Pfender, Florian. "Complete subgraphs in multipartite graphs." Combinatorica 32, no. 4 (2012): 483–95. http://dx.doi.org/10.1007/s00493-012-2425-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Delorme, C. "Eigenvalues of complete multipartite graphs." Discrete Mathematics 312, no. 17 (2012): 2532–35. http://dx.doi.org/10.1016/j.disc.2011.07.018.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Bahmanian, M. A. "Factorizations of complete multipartite hypergraphs." Discrete Mathematics 340, no. 2 (2017): 46–50. http://dx.doi.org/10.1016/j.disc.2016.08.007.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Gao, Yibo. "On the Critical Ideals of Complete Multipartite Graphs." Electronic Journal of Linear Algebra 36, no. 36 (2020): 94–105. http://dx.doi.org/10.13001/ela.2020.5123.

Full text

Abstract:

The notions of critical ideals and characteristic ideals of graphs are introduced by Corrales and Valencia to study properties of graphs, including clique number, zero forcing number, minimum rank and critical group. In this paper, we provide methods to compute critical ideals of complete multipartite graphs and obtain complete answers for the characteristic ideals of complete multipartite graphs.

APA, Harvard, Vancouver, ISO, and other styles

9

Gavril, Fanica. "Maximum weight induced multicliques and complete multipartite subgraphs in directed path overlap graphs." Discrete Mathematics, Algorithms and Applications 07, no. 04 (2015): 1550061. http://dx.doi.org/10.1142/s1793830915500615.

Full text

Abstract:

A graph is a directed path overlap graph if it is the overlap graph of family of directed paths in a rooted directed tree. A graph is a multiclique if its connected components are cliques. A graph is a complete multipartite graph if it is the complement of a multiclique. A graph is a multiclique-multipartite graph if its vertex set has a partition [Formula: see text], [Formula: see text] such that [Formula: see text] is complete multipartite, [Formula: see text] is a multiclique and every two vertices [Formula: see text], [Formula: see text] are adjacent. We describe a polynomial time algorith

APA, Harvard, Vancouver, ISO, and other styles

10

Vetrik, Tomáš. "List coloring of complete multipartite graphs." Discussiones Mathematicae Graph Theory 32, no. 1 (2012): 31. http://dx.doi.org/10.7151/dmgt.1583.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Complete Multipartite"

1

Anzur, Matthew Paul. "k-star decomposition of lambda-fold complete multipartite graphs." Auburn, Ala., 2007. http://repo.lib.auburn.edu/07M%20Dissertations/ANZUR_MATTHEW_39.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Sehgal, Nidhi Rodger C. A. "4-cycles systems of line graphs of complete multipartite graphs." Auburn, Ala, 2008. http://repo.lib.auburn.edu/EtdRoot/2008/SUMMER/Mathematics_and_Statistics/Thesis/Sehgal_Nidhi_47.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Cornaz, Denis. "Programmation linéaire pour les problèmes de sous-graphes p-partis complets et les télécommunication." Paris 6, 2003. http://www.theses.fr/2003PA066070.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Bard, Stefan. "Gray code numbers of complete multipartite graphs." Thesis, 2014. http://hdl.handle.net/1828/5815.

Full text

Abstract:

Let G be a graph and k be an integer greater than or equal to the chromatic number of G. The k-colouring graph of G is the graph whose vertices are k-colourings of G, with two colourings adjacent if they colour exactly one vertex differently. We explore the Hamiltonicity and connectivity of such graphs, with particular focus on the k-colouring graphs of complete multipartite graphs. We determine the connectivity of the k-colouring graph of the complete graph on n vertices for all n, and show that the k-colouring graph of a complete multipartite graph K is 2-connected whenever k is at least the

APA, Harvard, Vancouver, ISO, and other styles

5

Yen, Chih-Hung, and 嚴志弘. "Linear k-arboricity of Complete Multipartite Graphs." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/51062236171983835709.

Full text

Abstract:

博士<br>國立交通大學<br>應用數學系所<br>93<br>A decomposition of a graph is a list of subgraphs such that each edge appears in exactly one subgraph in the list. There are many interesting results and problems in this area. In this thesis, we study a special case of graph decomposition, called the linear k-arboricity problem. A linear k-forest is a graph whose components are paths with lengths at most k. The minimum number of linear k-forests needed to decompose a graph G is the linear k-arboricity of G, denoted la_{k}(G). Thus, the linear k-arboricity problem is what the value la_{k}(G) should be when a gr

APA, Harvard, Vancouver, ISO, and other styles

6

Chien-Yeh, Chen. "On the Minimum Diameter among Orientations of Complete Multipartite Graphs." 2006. http://www.cetd.com.tw/ec/thesisdetail.aspx?etdun=U0001-0807200612502200.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Liao, Wei-Hsuan, and 廖威絢. "The study of Decomposing a complete multipartite graph into pentagons." Thesis, 2002. http://ndltd.ncl.edu.tw/handle/80183608379753430640.

Full text

Abstract:

碩士<br>淡江大學<br>數學學系<br>90<br>A complete k-partite graph is a graph whose vertices can be partitioned into k disjoint nonempty sets, and there are no edges within two vertices which are in the same set, and every edge joins two vertices which are in different partite sets. A complete four-partite graph with n vertices in each partite set, then we will denote it by K4(n). A pentagon is a 5-cycle. K4(n) can be decomposed into pentagons if the edges of K4(n) can be partitioned into edge-disjoint 5-cycles. If the edges of K4(n) can not be completely partitioned into edge-disjoint 5-cycles, we will c

APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Complete Multipartite"

1

Horing, Norman J. Morgenstern. Dirac Notation and Transformation Theory. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198791942.003.0001.

Full text

Abstract:

Chapter 1 opens with a brief review of some basic features of quantum mechanics, including the Schrödinger equation, linear and angular momentum and the theory of the hydrogenic atom: It also includes complete orthonormal sets of eigenfunctions, the translation operator, current, spin, equation of continuity, gauge transformation, determinant & permanent multiparticle energy eigenfunctions for noninteracting particles and the Pauli exclusion principle. Attention is then focused on Dirac bra-ket notation and complete sets of commuting observables. In this connection, representations and tra

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Complete Multipartite"

1

Gervacio, Severino V. "Subdivision Number of Large Complete Graphs and Large Complete Multipartite Graphs." In Combinatorial Geometry and Graph Theory. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/978-3-540-30540-8_10.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Cho, Jung Rae, Jeongmi Park, and Yoshio Sano. "Edge-disjoint Decompositions of Complete Multipartite Graphs into Gregarious Long Cycles." In Computational Geometry and Graphs. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-45281-9_5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Gavril, Fanica. "Maximum Induced Multicliques and Complete Multipartite Subgraphs in Polygon-Circle Graphs and Circle Graphs." In Graph-Theoretic Concepts in Computer Science. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-34611-8_30.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Fabila-Monroy, Ruy, Carlos Hidalgo-Toscano, Clemens Huemer, Dolores Lara, and Dieter Mitsche. "Optimal Grid Drawings of Complete Multipartite Graphs and an Integer Variant of the Algebraic Connectivity." In Lecture Notes in Computer Science. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-04414-5_42.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Shalom, Mordechai, Prudence W. H. Wong, and Shmuel Zaks. "On-Line Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology." In Structural Information and Communication Complexity. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-11476-2_22.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Scripps, Jerry, Christian Trefftz, Greg Wolffe, Roger Ferguson, and Xiang Cao. "Repel Communities and Multipartite Networks." In Complex Networks and Their Applications VIII. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-36687-2_9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Maehara, Hiroshi. "On the Euclidean Dimension of a Complete Multipartite Graph." In Graph Theory and Applications, Proceedings of the First Japan Conference on Graph Theory and Applications. Elsevier, 1988. http://dx.doi.org/10.1016/s0167-5060(08)70794-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Abe, Sumiyoshi. "Generalized Nonadditive Information Theory and Quantum Entanglement." In Nonextensive Entropy. Oxford University Press, 2004. http://dx.doi.org/10.1093/oso/9780195159769.003.0007.

Full text

Abstract:

Nonadditive classical information theory is developed in the axiomatic framework and then translated into quantum theory. The nonadditive conditional entropy associated with the Tsallis entropy indexed by q is given in accordance with the formalism of nonextensive statistical mechanics. The theory is applied to the problems of quantum entanglement and separability of the Werner-Popescu-type mixed state of a multipartite system, in order to examine if it has any points superior to the additive theory with the von Neumann entropy realized in the limit q → 1. It is shown that the nonadditive theory can lead to the necessary and sufficient condition for separability of the Werner-Popescu-type state, whereas the von Neumann theory can give only a much weaker condition…. Tsallis' nonextensive generalization of Boltzmann-Gibbs statistical mechanics [3, 15, 16] and its success in describing behaviors of a large class of complex systems naturally lead to the question of whether information theory can also admit an analogous generalization. If the answer is affirmative, then that will be of particular importance in connection with the problem of quantum entanglement and quantum theory of measurement [6, 8], in which necessities of a nonadditive information measure and an information content are suggested. One should also remember that there exists a conceptual similarity between a complex system and an entangled quantum system. In these systems, a "part" is indivisibly connected with the rest. An external operation on any part drastically influences the whole system, in general. Thus, the traditional reductionistic approach to an understanding of the nature of such a system may not work efficiently. In this chapter, we report a recent development in nonadditive quantum information theory based on the Tsallis entropy indexed by q [15] and its associated nonadditive conditional entropy [1]. This theory includes the ordinary additive theory with the von Neumann entropy in a special limiting case: q → To see if it has points superior to the additive theory, we apply it to the problems of separability and quantum entanglement.

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Complete Multipartite"

1

Kumano, Yuta, Yoshiyuki Sakamaki, and Hironori Uchikawa. "Complete Multipartite Graph Codes." In 2018 International Symposium on Information Theory and Its Applications (ISITA). IEEE, 2018. http://dx.doi.org/10.23919/isita.2018.8664263.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Kim, Jung-Hyun, Mi-Young Nam, and Hong-Yeop Song. "Binary locally repairable codes from complete multipartite graphs." In 2015 International Conference on Information and Communication Technology Convergence (ICTC). IEEE, 2015. http://dx.doi.org/10.1109/ictc.2015.7354746.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Bettayeb, Said, and Quan T. Nguyen. "The genus of the complete multipartite graph and the complete multi-layered graph." In 2010 IEEE/ACS International Conference on Computer Systems and Applications (AICCSA). IEEE, 2010. http://dx.doi.org/10.1109/aiccsa.2010.5587024.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Heydari, Hoshang. "Complex Projective Scheme Approach to The Geometrical Structures of Multipartite Quantum Systems." In ADVANCES IN QUANTUM THEORY: Proceedings of the International Conference on Advances in Quantum Theory. AIP, 2011. http://dx.doi.org/10.1063/1.3567459.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Makimura, Yutaka, Hidehiko Kumagai, and Kenji Yamamoto. "CHEMO-ENZYMATIC SYNTHESIS OF MULTIPARTIAL COMPLEX-TYPE SIALO-GLYCOCOMPLEX USING TRANSGLYCOSYLATION ACTIVITY OF ENDO-M." In XXIst International Carbohydrate Symposium 2002. TheScientificWorld Ltd, 2002. http://dx.doi.org/10.1100/tsw.2002.615.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Buck, Richard M., and James M. Hall. "Applications of the COG multiparticle Monte Carlo transport code to simulated imaging of complex objects." In SPIE's International Symposium on Optical Science, Engineering, and Instrumentation, edited by Edward J. Morton. SPIE, 1999. http://dx.doi.org/10.1117/12.363699.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!