Log in

Relevant bibliographies by topics / Graphes tripartites

Contents

Journal articles
Dissertations / Theses
Book chapters
Conference papers

Academic literature on the topic 'Graphes tripartites'

Author: Grafiati

Published: 4 June 2021

Last updated: 8 June 2024

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 'Graphes tripartites.'

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 "Graphes tripartites"

1

Farooq, Rashid, Mehar Ali Malik, Qudsia Naureen, and Shariefuddin Pirzada. "On the nullity of a family of tripartite graphs." Acta Universitatis Sapientiae, Informatica 8, no. 1 (2016): 96–107. http://dx.doi.org/10.1515/ausi-2016-0006.

Full text

Abstract:

Abstract The eigenvalues of the adjacency matrix of a graph form the spectrum of the graph. The multiplicity of the eigenvalue zero in the spectrum of a graph is called nullity of the graph. Fan and Qian (2009) obtained the nullity set of n-vertex bipartite graphs and characterized the bipartite graphs with nullity n − 4 and the regular n-vertex bipartite graphs with nullity n − 6. In this paper, we study similar problem for a class of tripartite graphs. As observed the nullity problem in tripartite graphs does not follow as an extension to that of the nullity of bipartite graphs, this makes t

APA, Harvard, Vancouver, ISO, and other styles

2

Kalaiarasi, Kalaichelvan, L. Mahalakshmi, Nasreen Kausar, Sajida Kousar, and Parameshwari Kattel. "Perfect Fuzzy Soft Tripartite Graphs and Their Complements." Discrete Dynamics in Nature and Society 2022 (May 25, 2022): 1–10. http://dx.doi.org/10.1155/2022/1108887.

Full text

Abstract:

Fuzzy soft graphs are efficient numerical tools for simulating the uncertainty of the real world. A fuzzy soft graph is a perfect fusion of the fuzzy soft set and the graph model that is widely used in a variety of fields. This paper discusses a few unique notions of perfect fuzzy soft tripartite graphs (PFSTG), as well as the concepts of complement of perfect fuzzy soft tripartite graphs (CPFSTGs). Because soft sets are most useful in real-world applications, the newly developed concepts of perfect soft tripartite fuzzy graphs will lead to many theoretical applications by adding extra fuzzine

APA, Harvard, Vancouver, ISO, and other styles

3

Yin, Jun, Haixing Zhao, Xiujuan Ma, and Yalan Li. "Chromaticity of some Tripartite Graphs." Interdisciplinary journal of Discontinuity, Nonlinearity, and Complexity 11, no. 4 (2022): 645–50. http://dx.doi.org/10.5890/dnc.2022.12.006.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Seoud, M. A., and M. Z. Youssef. "On labelling complete tripartite graphs." International Journal of Mathematical Education in Science and Technology 28, no. 3 (1997): 367–71. http://dx.doi.org/10.1080/0020739970280306.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Bhalkikar, Abhijeet, and Yi Zhao. "On subgraphs of tripartite graphs." Discrete Mathematics 346, no. 1 (2023): 113152. http://dx.doi.org/10.1016/j.disc.2022.113152.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Alawn, Nawras A., Nadia M. G. Al-Saidi, and Rashed T. Rasheed. "Tripartite graphs with energy aggregation." Boletim da Sociedade Paranaense de Matemática 38, no. 7 (2019): 149–67. http://dx.doi.org/10.5269/bspm.v38i7.44463.

Full text

Abstract:

The aggregate of the absolute values of the graph eigenvalues is called the energy of a graph. It is used to approximate the total _-electron energy of molecules. Thus, finding a new mechanism to calculate the total energy of some graphs is a challenge; it has received a lot of research attention. We study the eigenvalues of a complete tripartite graph Ti,i,n−2i , for n _ 4, based on the adjacency, Laplacian, and signless Laplacian matrices. In terms of the degree sequence, the extreme eigenvalues of the irregular graphs energy are found to characterize the component with the maximum energy. T

APA, Harvard, Vancouver, ISO, and other styles

7

Sullivan, Eric, and Paul S. Wenger. "Saturation Numbers in Tripartite Graphs." Journal of Graph Theory 84, no. 4 (2016): 428–42. http://dx.doi.org/10.1002/jgt.22033.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Camacho, Charles, Silvia Fernández‐Merchant, Marija Jelić Milutinović, et al. "Bounding the tripartite‐circle crossing number of complete tripartite graphs." Journal of Graph Theory 100, no. 1 (2021): 5–27. http://dx.doi.org/10.1002/jgt.22763.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Bunge, Ryan C. "On 1-rotational decompositions of complete graphs into tripartite graphs." Opuscula Mathematica 39, no. 5 (2019): 623–43. http://dx.doi.org/10.7494/opmath.2019.39.5.623.

Full text

Abstract:

Consider a tripartite graph to be any simple graph that admits a proper vertex coloring in at most 3 colors. Let \(G\) be a tripartite graph with \(n\) edges, one of which is a pendent edge. This paper introduces a labeling on such a graph \(G\) used to achieve 1-rotational \(G\)-decompositions of \(K_{2nt}\) for any positive integer \(t\). It is also shown that if \(G\) with a pendent edge is the result of adding an edge to a path on \(n\) vertices, then \(G\) admits such a labeling.

APA, Harvard, Vancouver, ISO, and other styles

10

Chiang, N. P. "Chaotic Numbers of Complete Bipartite Graphs and Tripartite Graphs." Journal of Optimization Theory and Applications 131, no. 3 (2006): 485–91. http://dx.doi.org/10.1007/s10957-006-9152-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Graphes tripartites"

1

Alborzi, Seyed Ziaeddin. "Automatic Discovery of Hidden Associations Using Vector Similarity : Application to Biological Annotation Prediction." Electronic Thesis or Diss., Université de Lorraine, 2018. http://www.theses.fr/2018LORR0035.

Full text

Abstract:

Cette thèse présente: 1) le développement d'une nouvelle approche pour trouver des associations directes entre des paires d'éléments liés indirectement à travers diverses caractéristiques communes, 2) l'utilisation de cette approche pour associer directement des fonctions biologiques aux domaines protéiques (ECDomainMiner et GODomainMiner) et pour découvrir des interactions domaine-domaine, et enfin 3) l'extension de cette approche pour annoter de manière complète à partir des domaines les structures et les séquences des protéines. Au total, 20 728 et 20 318 associations EC-Pfam et GO-Pfam non

APA, Harvard, Vancouver, ISO, and other styles

2

Alborzi, Seyed Ziaeddin. "Automatic Discovery of Hidden Associations Using Vector Similarity : Application to Biological Annotation Prediction." Thesis, Université de Lorraine, 2018. http://www.theses.fr/2018LORR0035/document.

Full text

Abstract:

Cette thèse présente: 1) le développement d'une nouvelle approche pour trouver des associations directes entre des paires d'éléments liés indirectement à travers diverses caractéristiques communes, 2) l'utilisation de cette approche pour associer directement des fonctions biologiques aux domaines protéiques (ECDomainMiner et GODomainMiner) et pour découvrir des interactions domaine-domaine, et enfin 3) l'extension de cette approche pour annoter de manière complète à partir des domaines les structures et les séquences des protéines. Au total, 20 728 et 20 318 associations EC-Pfam et GO-Pfam non

APA, Harvard, Vancouver, ISO, and other styles

3

Creswell, Stephanie A. "The Linear Cutwidth and Cyclic Cutwidth of Complete n-Partite Graphs." CSUSB ScholarWorks, 2014. https://scholarworks.lib.csusb.edu/etd/34.

Full text

Abstract:

The cutwidth of different graphs is a topic that has been extensively studied. The basis of this paper is the cutwidth of complete n-partite graphs. While looking at the cutwidth of complete n-partite graphs, we strictly consider the linear embedding and cyclic embedding. The relationship between the linear cutwidth and the cyclic cutwidth is discussed and used throughout multiple proofs of different cases for the cyclic cutwidth. All the known cases for the linear and cyclic cutwidth of complete bipartite, complete tripartite, and complete n-partite graphs are highlighted. The main focus of t

APA, Harvard, Vancouver, ISO, and other styles

4

WU, BAO-LIN, and 吳寶林. "The total colorings of the complete tripartite graphs." Thesis, 1990. http://ndltd.ncl.edu.tw/handle/75684817456433006596.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Kuo, Chun-Yi, and 郭俊億. "On the IC-colorings of complete tripartite graphs." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/49537015849169965661.

Full text

Abstract:

碩士<br>中原大學<br>應用數學研究所<br>99<br>Let $G$ be a graph and let $f$ be a function which maps $V(G)$ into the set of positive integers. We define $f(H)=Sigma_{v in V(H)}f(v)$ for each subgraph $H$ of $G$. We say $f$ to be an extit{IC-coloring} of $G$ if for any integer $k in [1,f(G)]$ there is a connected subgraph $H$ of $G$ such that $f(H)=k$. Clearly, any connected graph $G$ admits an IC-coloring. The extit{IC-index} of a graph $G$, denoted by $M(G)$, is defined to be $M(G)= maxleftlbrace f(G)mid ight.$ $f$ is an IC-coloring of $left. G ight brace$. If $f$ is an IC-coloring of $G$ such that $f(

APA, Harvard, Vancouver, ISO, and other styles

6

Jie, Huang-Bang, and 黃邦傑. "On (p,1)-Total Labelings of Balanced Complete Tripartite Graphs." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/b5yhdq.

Full text

Abstract:

碩士<br>中原大學<br>應用數學研究所<br>102<br>Let G=(V,E) be a graph. A (p,1)-total labeling of G is a mapping from V∪E into {0,…, λ} for some integer λ such that : (i) if x and y are adjacent vertices, then ; (ii) if e and f are adjacent edges, then ; (iii) if an edge e is incident to a vertex x, then , where p is a positive integer. The span of a (p,1)-total labeling is the maximum difference between two labels. The (p,1)-total number of a graph G is the minimum span of a (p,1) -total labeling of G, denoted by λ_p^T (G). In this thesis, we prove that for each integer n≥2, λ_p^T (K_(n,n,n) )≤2n+p+1. M

APA, Harvard, Vancouver, ISO, and other styles

7

Tsai, Chia-Hsin, and 蔡家欣. "On the IC-colorings of complete tripartite graphs K(1,m,n)." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/42854476016480962314.

Full text

Abstract:

碩士<br>中原大學<br>應用數學研究所<br>100<br>Let G be a graph and let f be a function which maps V(G) into the set of positive integers.We define f(H)=simf(v),v in V(H) for each subgraph H of G.We say f to be an IC-coloring of G if for any integer k in [1,f(G)] there is a connected subgraph H of G such that f(H)=k.Clearly, any connected graph G admits an IC-coloring. The IC -index of a graph G, denoted by M(G) ,is defined to be M(G)=max(f(G),f is a IC-coloring of G).If f is an IC-coloring of G such that f(G)=M(G),then we say that f is an maximal IC-coloring of G. In this thesis, we mainly study the IC-col

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Graphes tripartites"

1

Yeung, Ching-man Au, Nicholas Gibbins, and Nigel Shadbolt. "Mutual Contextualization in Tripartite Graphs of Folksonomies." In The Semantic Web. Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-76298-0_79.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Pranjali and Renu Naresh. "Nullity and Energy of Complete Tripartite Graphs." In Recent Advancements in Graph Theory. CRC Press, 2020. http://dx.doi.org/10.1201/9781003038436-23.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Mahmoodian, E. S., and Maryam Mirzakhani. "Decomposition of Complete Tripartite Graphs Into 5-Cycles." In Combinatorics Advances. Springer US, 1995. http://dx.doi.org/10.1007/978-1-4613-3554-2_15.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Bonomo, Mariella, Armando La Placa, and Simona E. Rombo. "Prediction of lncRNA-Disease Associations from Tripartite Graphs." In Heterogeneous Data Management, Polystores, and Analytics for Healthcare. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-71055-2_16.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Pai, Kung-Jui, Shyue-Ming Tang, Jou-Ming Chang, and Jinn-Shyong Yang. "Completely Independent Spanning Trees on Complete Graphs, Complete Bipartite Graphs and Complete Tripartite Graphs." In Advances in Intelligent Systems and Applications - Volume 1. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-35452-6_13.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Araujo-Pardo, Gabriela, Zhanar Berikkyzy, Jill Faudree, et al. "Finding Long Cycles in Balanced Tripartite Graphs: A First Step." In Association for Women in Mathematics Series. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-77983-2_1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Jayawardene, Chula J. "Tripartite and Quadpartite Size Ramsey Numbers for All Pairs of Connected Graphs on Four Vertices." In Handbook of Research on Advanced Applications of Graph Theory in Modern Society. IGI Global, 2020. http://dx.doi.org/10.4018/978-1-5225-9380-5.ch010.

Full text

Abstract:

A popular area of graph theory is based on a paper written in 1930 by F. P. Ramsey titled “On a Problem on Formal Logic.” A theorem which was proved in his paper triggered the study of modern Ramsey theory. However, his premature death at the young age of 26 hindered the development of this area of study at the initial stages. The balanced size multipartite Ramsey number mj (H,G) is defined as the smallest positive number s such that Kj×s→ (H,G). There are 36 pairs of (H, G), when H, G represent connected graphs on four vertices (as there are only 6 non-isomorphic connected graphs on four vertices). In this chapter, the authors find mj (H, G) exhaustively for all such pairs in the tripartite case j=3, and in the quadpartite case j=4, excluding the case m4 (K4,K4). In this case, the only known result is that m4 (K4,K4) is greater than or equal to 4, since no upper bound has been found as yet.

APA, Harvard, Vancouver, ISO, and other styles

8

Tian, Junfeng, and He Zhang. "A Credible Cloud Service Model Based on Behavior Graphs and Tripartite Decision-Making Mechanism." In Cloud Security. IGI Global, 2019. http://dx.doi.org/10.4018/978-1-5225-8176-5.ch047.

Full text

Abstract:

The credibility of cloud service is the key to the success of the application of cloud services. The dual servers of master server and backup server are applied to cloud services, which can improve the availability of cloud services. In the past, the failures between master server and backup server could be detected by heartbeat algorithm. Because of lacking cloud user's evaluation, the authors put forward a credible cloud service model based on behavior Graphs and tripartite decision-making mechanism. By the quantitative of cloud users' behaviors evidences, the construction of behavior Graphs and the judgment of behavior, they select the most credible cloud user. They combine the master server, the backup server and the selected credible cloud user to determine the credibility of cloud service by the tripartite decision-making mechanism. Finally, according to the result of credible judgment, the authors could decide whether it will be switched from the master server to the backup server.

APA, Harvard, Vancouver, ISO, and other styles

9

El Refaie, Elisabeth. "A Tripartite Taxonomy of Visual Metaphor in Graphic Illness Narratives." In Visual Metaphor and Embodiment in Graphic Illness Narratives. Oxford University Press, 2019. http://dx.doi.org/10.1093/oso/9780190678173.003.0004.

Full text

Abstract:

This chapter uses the analysis of 35 graphic illness narratives to identify the various forms that visual metaphor may take in this genre. A novel tripartite classification system that distinguishes between pictorial, spatial, and stylistic metaphors is proposed. Pictorial metaphors, which use images of concrete animate or inanimate objects to stand for something else, have received a lot of scholarly attention in recent years, but this study offers the first systematic description of the other two types of visual metaphor. Spatial metaphors exploit the relative size, arrangement, and orientation of elements on the page to convey more abstract meanings, whereas in the case of stylistic metaphors, features such as color, shape, level of detail, and quality of line are used to indicate an abstract concept or a nonvisual sense perception. These three categories can be further subdivided, and in many instances several distinct types of metaphor are used in combination.

APA, Harvard, Vancouver, ISO, and other styles

10

Etty, John. "Krokodil’s Format and Visual Language." In Graphic Satire in the Soviet Union. University Press of Mississippi, 2019. http://dx.doi.org/10.14325/mississippi/9781496820525.003.0003.

Full text

Abstract:

The first half of the chapter considers six political, cultural and social traditions-pre-revolutionary satirical literature, pre-revolutionary satirical journals, the lubok, Orthodox iconography, Soviet satire theory, and Soviet theatre-that influenced Krokodil. Tracing a fuller picture of Krokodil's heritages than previous literature provides, this chapter shows that Krokodil was the progeny of a complex system of satirical legacies, and it was also engaged in a mutually productive relationship with contemporary satirical forms. The chapter's second half analyzes Krokodil's visual language that is intended to move beyond the support/criticism binary vision of the magazine proposed by previous interpretations, and it thus proposes a tripartite model for explaining Krokodil's visual language. Considering all of Krokodil's graphic schemata-cartoons "contesting" anti-Soviet ideology, those "affirming" Soviet ideology, and images depicting the process of "becoming" Soviet-this chapter reveals how the magazine's cartoons dialogically and self-reflexively commented on serious Soviet discourses on graphic satire.

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Graphes tripartites"

1

Chahua, Luis, and Juan Gutiérrez. "On Tuza's conjecture in even co-chain graphs." In Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2022. http://dx.doi.org/10.5753/etc.2022.223185.

Full text

Abstract:

In 1981, Tuza conjectured that the cardinality of a minimum set of edges that intersects every triangle of a graph is at most twice the cardinality of a maximum set of edge-disjoint triangles. This conjecture has been proved for several important graph classes, as planar graphs, tripartite graphs, among others. However, it remains open on other important classes of graphs, as chordal graphs. Furthermore, it remains open for main subclasses of chordal graphs, as split graphs and interval graphs. In this paper, we show that Tuza’s conjecture is valid for even co-chain graphs, a known subclass of

APA, Harvard, Vancouver, ISO, and other styles

2

Luke, Andrew, Joseph Johnson, and Yiu-Kai Ng. "Recommending Long-Tail Items Using Extended Tripartite Graphs." In 2018 IEEE International Conference on Big Knowledge (ICBK). IEEE, 2018. http://dx.doi.org/10.1109/icbk.2018.00024.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Chen, Cheng, Stephen K. Grady, Sally R. Ellingson, and Michael A. Langston. "Gene-disease-drug link prediction using tripartite graphs." In BCB '21: 12th ACM International Conference on Bioinformatics, Computational Biology and Health Informatics. ACM, 2021. http://dx.doi.org/10.1145/3459930.3469505.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Johnson, Joseph, and Yiu-Kai Ng. "Using tripartite graphs to make long tail recommendations." In 2017 8th International Conference on Information, Intelligence, Systems & Applications (IISA). IEEE, 2017. http://dx.doi.org/10.1109/iisa.2017.8316436.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Grzesik, Andrzej, and Hrant Khachatrian. "On interval edge-colorings of complete tripartite graphs." In 2013 Computer Science and Information Technologies (CSIT). IEEE, 2013. http://dx.doi.org/10.1109/csitechnol.2013.6710340.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Li, Mi, Jie Huang, and Jingpeng Wang. "Accelerated diffusion-based recommendation algorithm on tripartite graphs with GPU clusters." In 2016 17th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD). IEEE, 2016. http://dx.doi.org/10.1109/snpd.2016.7515917.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Chelmis, Charalampos, and Viktor K. Prasanna. "Exploring generative models of tripartite graphs for recommendation in social media." In the 4th International Workshop. ACM Press, 2013. http://dx.doi.org/10.1145/2463656.2463658.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Johnson, Joseph, and Yiu-Kai Ng. "Enhancing long tail item recommendations using tripartite graphs and Markov process." In WI '17: International Conference on Web Intelligence 2017. ACM, 2017. http://dx.doi.org/10.1145/3106426.3106439.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Gharibshah, Zhabiz, and Xingquan Zhu. "TriNE: Network Representation Learning for Tripartite Heterogeneous Networks." In 2020 IEEE International Conference on Knowledge Graph (ICKG). IEEE, 2020. http://dx.doi.org/10.1109/icbk50248.2020.00076.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Zheng, Juanli, and Fuyi Wei. "Research on Knowledge Recommendation Based on Weighted Directional Tripartite Graphic Network Structure." In ChineseCSCW '17: Chinese Conference on Computer Supported Cooperative Work and Social Computing. ACM, 2017. http://dx.doi.org/10.1145/3127404.3127441.

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!