Log in

Relevant bibliographies by topics / Connectivité des graphes / Journal articles

To see the other types of publications on this topic, follow the link: Connectivité des graphes.

Journal articles on the topic 'Connectivité des graphes'

Author: Grafiati

Published: 26 July 2024

Last updated: 31 July 2025

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

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Connectivité des graphes.'

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 journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

THIERRY, Chloé, and Laure SANTONI. "Prise en compte des réseaux écologiques par les entreprises grâce à la modélisation de la connectivité avec Graphab." Sciences Eaux & Territoires, no. 46 (October 29, 2024): 8110. http://dx.doi.org/10.20870/revue-set.2024.46.8110.

Full text

Abstract:

La fragmentation et la destruction des habitats naturels résultant des activités humaines jouent un rôle majeur dans le déclin de la biodiversité. Restaurer les continuités écologiques est un bon moyen d’action pour limiter ces impacts, et les entreprises, gestionnaires de foncier, sont concernées par ces enjeux. Cet article expose les choix méthodologiques à effectuer lors des différentes étapes de la modélisation de la connectivité par la théorie des graphes (avec le logiciel Graphab) ainsi que différents contextes d’utilisations de celle-ci pour des sites d’entreprises. La modélisation de l

APA, Harvard, Vancouver, ISO, and other styles

2

BONCOURT, Étienne, André EVETTE, Laurent BERGÈS, and Maria ALP. "Le génie végétal au secours de la connectivité écologique des berges de cours d’eau." Sciences Eaux & Territoires, no. 46 (November 12, 2024): 8072. http://dx.doi.org/10.20870/revue-set.2024.46.8072.

Full text

Abstract:

Dans les zones urbanisées, les rivières et les écosystèmes riverains sont souvent les seuls corridors écologiques disponibles pour le déplacement de la faune. Cependant, les berges y sont souvent stabilisées par des ouvrages de génie civil, ce qui peut entraîner une dégradation de l'habitat et une perte de connectivité de ces habitats à l'échelle du paysage. Les ouvrages de génie végétal sont une alternative aux enrochements, car ils maintiennent la qualité des écosystèmes naturels en utilisant des espèces végétales indigènes au lieu de rochers, mais leur impact positif potentiel sur les mouve

APA, Harvard, Vancouver, ISO, and other styles

3

CLAUZEL, Céline, Christophe EGGERT, Simon TARABON, et al. "Analyser la connectivité de la trame turquoise : définition, caractérisation et enjeux opérationnels." Sciences Eaux & Territoires, no. 43 (October 16, 2023): 67–71. http://dx.doi.org/10.20870/revue-set.2023.43.7642.

Full text

Abstract:

Revue Sciences Eaux & Territoires - Vient de paraître en ligneLa fragmentation du paysage se matérialise par une rupture de connexion au sein des réseaux écologiques. Le concept de trame verte et bleue est apparu comme un outil de protection et de restauration des continuités écologiques dans les territoires. De nouvelles trames écologiques ont récemment été proposées pour identifier d’autres discontinuités écologiques effectives. C’est notamment le cas de la trame turquoise associant la trame bleue et la partie de la trame verte en interaction fonctionnelle. La trame turquoise regroupe ai

APA, Harvard, Vancouver, ISO, and other styles

4

Durand-Dubief, Françoise, Gabriel Kocevar, Claudio Stamile, Salem Hannoun, François Cotton, and Dominique Sappey-Marinier. "Analyse de la connectivité structurelle cérébrale par la théorie des graphes : une nouvelle caractérisation des formes cliniques de sclérose en plaques." Revue Neurologique 173 (March 2017): S124. http://dx.doi.org/10.1016/j.neurol.2017.01.216.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Chawki, M. B., A. Verger, E. Klesse, et al. "Étude TEP cérébrale des troubles du contrôle des impulsions dans la maladie de Parkinson : approche de la connectivité métabolique par théorie des graphes." Médecine Nucléaire 42, no. 3 (2018): 137. http://dx.doi.org/10.1016/j.mednuc.2018.03.015.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Prajapati, Rajeshri, Amit Parikh, and Pradeep Jha. "Exploring Novel Edge Connectivity in Graph Theory and its Impact on Eulerian Line Graphs." International Journal of Science and Research (IJSR) 12, no. 11 (2023): 1515–19. http://dx.doi.org/10.21275/sr231120155230.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Manickam, Machasri, and Kalyani Desikan. "Relationship Between the Second Largest Adjacency and Signless Laplacian Eigenvalues of Graphs and Properties of Planar Graphs." European Journal of Pure and Applied Mathematics 17, no. 4 (2024): 3004–21. https://doi.org/10.29020/nybg.ejpam.v17i4.5364.

Full text

Abstract:

A graph’s second largest eigenvalue is a significant algebraic characteristic that provides details on the graph’s expansion, connectivity, and randomness. Bounds for the second largest eigenvalue of a graph, denoted as λ2 were previously established in the literature in relation to graph parameters like edge connectivity and vertex connectivity, matching number, independencenumber, and edge expansion constant, among others. A graph is planar if it can be drawn in a plane without graph edges crossing. Determining the planarity of a graph helps in optimizing, simplifying, and understanding comp

APA, Harvard, Vancouver, ISO, and other styles

8

Kulli, V. R. "ATOM BOND CONNECTIVITY E-BANHATTI INDICES." INTERNATIONAL JOURNAL OF MATHEMATICS AND COMPUTER RESEARCH 11, no. 01 (2023): 3201–8. http://dx.doi.org/10.47191/ijmcr/v11i1.13.

Full text

Abstract:

In this paper, we introduce the atom bond connectivity E-Banhatti index and the sum atom bond connectivity E-Banhatti index of a graph. Also we compute these newly defined atom bond connectivity E-Banhatti indices for wheel graphs, friendship graphs, chain silicate networks, honeycomb networks and nanotubes.

APA, Harvard, Vancouver, ISO, and other styles

9

Mehmet, Şerif Aldemir, Ediz Süleyman, Çiftçi İdris, Yamaç Kerem, and Taş Ziyattin. "Domination edge connectivity of graphs." Graphs and Linear Algebra, no. 2 (September 23, 2023): 1–10. https://doi.org/10.5281/zenodo.8372637.

Full text

Abstract:

Domination and connectivity are two independent subjects of graph theory which have many applications in computer and information sciences. To bring these two terms together, we first define a novel conditional connectivity measure: k-domination edge connectivity.   In this study we compute k-domination edge connectivity of paths, cycles and complete graphs.

APA, Harvard, Vancouver, ISO, and other styles

10

Zhao, Kewen. "A simple proof of Whitney's Theorem on connectivity in graphs." Mathematica Bohemica 136, no. 1 (2011): 25–26. http://dx.doi.org/10.21136/mb.2011.141446.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Boronina, Anna, Vladimir Maksimenko, and Alexander E. Hramov. "Convolutional Neural Network Outperforms Graph Neural Network on the Spatially Variant Graph Data." Mathematics 11, no. 11 (2023): 2515. http://dx.doi.org/10.3390/math11112515.

Full text

Abstract:

Applying machine learning algorithms to graph-structured data has garnered significant attention in recent years due to the prevalence of inherent graph structures in real-life datasets. However, the direct application of traditional deep learning algorithms, such as Convolutional Neural Networks (CNNs), is limited as they are designed for regular Euclidean data like 2D grids and 1D sequences. In contrast, graph-structured data are in a non-Euclidean form. Graph Neural Networks (GNNs) are specifically designed to handle non-Euclidean data and make predictions based on connectivity rather than

APA, Harvard, Vancouver, ISO, and other styles

12

V.R., Kulli. "Downhill Product Connectivity Indices of Graphs." International Journal of Mathematics and Computer Research 13 (May 21, 2025): 5223–26. https://doi.org/10.5281/zenodo.15481118.

Full text

Abstract:

In this study, we introduce the downhill product connectivity index and reciprocal downhill product connectivity index and their corresponding exponentials of a graph. Furthermore, we compute these indices for some standard graphs, wheel graphs.

APA, Harvard, Vancouver, ISO, and other styles

13

de Fraysseix, Hubert, and Patrice Ossona de Mendez. "Connectivity of Planar Graphs." Journal of Graph Algorithms and Applications 5, no. 5 (2001): 93–105. http://dx.doi.org/10.7155/jgaa.00041.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Knor, Martin, and Ludovít Niepel. "Connectivity of path graphs." Discussiones Mathematicae Graph Theory 20, no. 2 (2000): 181. http://dx.doi.org/10.7151/dmgt.1118.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Rhodes, F., and S. Wilson. "Connectivity of Knight's Graphs." Proceedings of the London Mathematical Society s3-67, no. 2 (1993): 225–42. http://dx.doi.org/10.1112/plms/s3-67.2.225.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Jackson, Bill, and Tibor Jordánn. "Connectivity Augmentation of Graphs." Electronic Notes in Discrete Mathematics 5 (July 2000): 185–88. http://dx.doi.org/10.1016/s1571-0653(05)80158-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Chávez-Domínguez, Javier Alejandro, and Andrew T. Swift. "Connectivity for quantum graphs." Linear Algebra and its Applications 608 (January 2021): 37–53. http://dx.doi.org/10.1016/j.laa.2020.08.020.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Acer, Utku Günay, Petros Drineas, and Alhussein A. Abouzeid. "Connectivity in time-graphs." Pervasive and Mobile Computing 7, no. 2 (2011): 160–71. http://dx.doi.org/10.1016/j.pmcj.2010.11.011.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Hager, Michael. "Path-connectivity in graphs." Discrete Mathematics 59, no. 1-2 (1986): 53–59. http://dx.doi.org/10.1016/0012-365x(86)90068-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Currie, J. D. "Connectivity of distance graphs." Discrete Mathematics 103, no. 1 (1992): 91–94. http://dx.doi.org/10.1016/0012-365x(92)90042-e.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Matsumoto, Naoki, and Tomoki Nakamigawa. "Game connectivity of graphs." Discrete Mathematics 343, no. 11 (2020): 112104. http://dx.doi.org/10.1016/j.disc.2020.112104.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Boros, Endre, Pinar Heggernes, Pim van 't Hof, and Martin Milanič. "Vector connectivity in graphs." Networks 63, no. 4 (2014): 277–85. http://dx.doi.org/10.1002/net.21545.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Mutar, Mohammed A., Daniele Ettore Otera, and Hasan A. Khawwan. "Dual Connectivity in Graphs." Mathematics 13, no. 2 (2025): 229. https://doi.org/10.3390/math13020229.

Full text

Abstract:

An edge-coloring σ of a connected graph G is called rainbow if there exists a rainbow path connecting any pair of vertices. In contrast, σ is monochromatic if there is a monochromatic path between any two vertices. Some graphs can admit a coloring which is simultaneously rainbow and monochromatic; for instance, any coloring of Kn is rainbow and monochromatic. This paper refers to such a coloring as dual coloring. We investigate dual coloring on various graphs and raise some questions about the sufficient conditions for connected graphs to be dual connected.

APA, Harvard, Vancouver, ISO, and other styles

24

Oellermann, Ortrud R. "Major n-connected graphs." Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics 47, no. 1 (1989): 43–52. http://dx.doi.org/10.1017/s1446788700031189.

Full text

Abstract:

AbstractAn induced subgraph H of connectivity (edge-connectivity) n in a graph G is a major n-connected (major n-edge-connected) subgraph of G if H contains no subgraph with connectivity (edge- connectivity) exceeding n and H has maximum order with respect to this property. An induced subgraph is a major (major edge-) subgraph if it is a major n-connected (major n-edge-connected) subgraph for some n. Let m be the maximum order among all major subgraphs of C. Then the major connectivity set K(G) of G is defined as the set of all n for which there exists a major n-connected subgraph of G having

APA, Harvard, Vancouver, ISO, and other styles

25

Yalaniak Supriya Butte, Ashwini. "Neighbour Degree Connectivity Indices of Graphs and Its Applications to the Octane Isomers." International Journal of Science and Research (IJSR) 12, no. 4 (2023): 1892–96. http://dx.doi.org/10.21275/sr23716144709.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Jiang, Huiqin, and Yongsheng Rao. "Connectivity Index in Vague Graphs with Application in Construction." Discrete Dynamics in Nature and Society 2022 (February 15, 2022): 1–15. http://dx.doi.org/10.1155/2022/9082693.

Full text

Abstract:

The vague graph (VG), which has recently gained a place in the family of fuzzy graph (FG), has shown good capabilities in the face of problems that cannot be expressed by fuzzy graphs and interval-valued fuzzy graphs. Connectivity index (CI) in graphs is a fundamental issue in fuzzy graph theory that has wide applications in the real world. The previous definitions’ limitations in the connectivity of fuzzy graphs directed us to offer new classifications in vague graph. Hence, in this paper, we investigate connectivity index, average connectivity index, and Randic index in vague graphs with sev

APA, Harvard, Vancouver, ISO, and other styles

27

Ali, Akbar, Ivan Gutman, Izudin Redžepović, Jaya Percival Mazorodze, Abeer M. Albalahi, and Amjad E. Hamza. "On the Difference of Atom-Bond Sum-Connectivity and Atom-Bond-Connectivity Indices." MATCH – Communications in Mathematical and in Computer Chemistry 91, no. 3 (2023): 725–40. http://dx.doi.org/10.46793/match.91-3.725a.

Full text

Abstract:

The atom-bond connectivity (ABC) index is one of the wellinvestigated degree-based topological indices. The atom-bond sumconnectivity (ABS) index is a modified version of the ABC index, which was introduced recently. The primary goal of the present paper is to investigate the difference between the aforementioned two indices, namely ABS − ABC. It is shown that the difference ABS − ABC is positive for all graphs of minimum degree at least 2 as well as for all line graphs of those graphs of order at least 5 that are different from the path and cycle graphs. By means of computer search, the diffe

APA, Harvard, Vancouver, ISO, and other styles

28

Santra, Shyam Sundar, Prabhakaran Victor, Mahadevan Chandramouleeswaran, Rami Ahmad El-Nabulsi, Khaled Mohamed Khedher, and Vediyappan Govindan. "Connectivity of Semiring Valued Graphs." Symmetry 13, no. 7 (2021): 1227. http://dx.doi.org/10.3390/sym13071227.

Full text

Abstract:

Graph connectivity theory is important in network implementations, transportation, network routing and network tolerance, among other things. Separation edges and vertices refer to single points of failure in a network, and so they are often sought-after. Chandramouleeswaran et al. introduced the principle of semiring valued graphs, also known as S-valued symmetry graphs, in 2015. Since then, works on S-valued symmetry graphs such as vertex dominating set, edge dominating set, regularity, etc. have been done. However, the connectivity of S-valued graphs has not been studied. Motivated by this,

APA, Harvard, Vancouver, ISO, and other styles

29

Kim, Jaehoon, and Suil O. "Average connectivity and average edge-connectivity in graphs." Discrete Mathematics 313, no. 20 (2013): 2232–38. http://dx.doi.org/10.1016/j.disc.2013.05.024.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Li, Chunfang, Shangwei Lin, and Shengjia Li. "Structure connectivity and substructure connectivity of star graphs." Discrete Applied Mathematics 284 (September 2020): 472–80. http://dx.doi.org/10.1016/j.dam.2020.04.009.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Basavanagoud, B., Veena R. Desai та Shreekant Patil. "(β ,α)−Connectivity Index of Graphs". Applied Mathematics and Nonlinear Sciences 2, № 1 (2017): 21–30. http://dx.doi.org/10.21042/amns.2017.1.00003.

Full text

Abstract:

AbstractLet Eβ (G) be the set of paths of length β in a graph G. For an integer β ≥ 1 and a real number α, the (β,α)-connectivity index is defined as$$\begin{array}{} \displaystyle ^\beta\chi_\alpha(G)=\sum \limits_{v_1v_2 \cdot \cdot \cdot v_{\beta+1}\in E_\beta(G)}(d_{G}(v_1)d_{G}(v_2)...d_{G}(v_{\beta+1}))^{\alpha}. \end{array}$$The (2,1)-connectivity index shows good correlation with acentric factor of an octane isomers. In this paper, we compute the (2, α)-connectivity index of certain class of graphs, present the upper and lower bounds for (2, α)-connectivity index in terms of number of

APA, Harvard, Vancouver, ISO, and other styles

32

Kolokolnikov, Theodore. "It Is Better to Be Semi-Regular When You Have a Low Degree." Entropy 26, no. 12 (2024): 1014. http://dx.doi.org/10.3390/e26121014.

Full text

Abstract:

We study the algebraic connectivity for several classes of random semi-regular graphs. For large random semi-regular bipartite graphs, we explicitly compute both their algebraic connectivity as well as the full spectrum distribution. For an integer d∈3,7, we find families of random semi-regular graphs that have higher algebraic connectivity than random d-regular graphs with the same number of vertices and edges. On the other hand, we show that regular graphs beat semi-regular graphs when d≥8. More generally, we study random semi-regular graphs whose average degree is d, not necessarily an inte

APA, Harvard, Vancouver, ISO, and other styles

33

Pathave, Deepak, S. A. Tapadia, and B. N. Waphare. "Super point graph and point completion number." Journal of Combinatorial Mathematics and Combinatorial Computing 126 (May 20, 2025): 183–93. https://doi.org/10.61091/jcmcc126-11.

Full text

Abstract:

Graph invariants, often regarded as topological indices, play a pivotal role in understanding and quantifying the structural properties of graphs. Among these, the line completion number has emerged as a significant measure of a graph’s edge connectivity and topology. In 1992, Bagga et al. defined a generalization of line graphs, namely super line graphs, and introduced the concept of the line completion number as a topological index of a graph. They calculated the line completion number for several classes of graphs, showcasing its utility in understanding graph structure. The line completion

APA, Harvard, Vancouver, ISO, and other styles

34

Akram, Muhammad, Sidra Sayed, and Florentin Smarandache. "Neutrosophic Incidence Graphs With Application." Axioms 7, no. 3 (2018): 47. http://dx.doi.org/10.3390/axioms7030047.

Full text

Abstract:

In this research study, we introduce the notion of single-valued neutrosophic incidence graphs. We describe certain concepts, including bridges, cut vertex and blocks in single-valued neutrosophic incidence graphs. We present some properties of single-valued neutrosophic incidence graphs. We discuss the edge-connectivity, vertex-connectivity and pair-connectivity in neutrosophic incidence graphs. We also deal with a mathematical model of the situation of illegal migration from Pakistan to Europe.

APA, Harvard, Vancouver, ISO, and other styles

35

Sebastian, Arya, John N. Mordeson, and Sunil Mathew. "Generalized Fuzzy Graph Connectivity Parameters with Application to Human Trafficking." Mathematics 8, no. 3 (2020): 424. http://dx.doi.org/10.3390/math8030424.

Full text

Abstract:

Graph models are fundamental in network theory. But normalization of weights are necessary to deal with large size networks like internet. Most of the research works available in the literature have been restricted to an algorithmic perspective alone. Not much have been studied theoretically on connectivity of normalized networks. Fuzzy graph theory answers to most of the problems in this area. Although the concept of connectivity in fuzzy graphs has been widely studied, one cannot find proper generalizations of connectivity parameters of unweighted graphs. Generalizations for some of the exis

APA, Harvard, Vancouver, ISO, and other styles

36

Jiang, Guisheng, Guidong Yu, and Jinde Cao. "The Least Algebraic Connectivity of Graphs." Discrete Dynamics in Nature and Society 2015 (2015): 1–9. http://dx.doi.org/10.1155/2015/756960.

Full text

Abstract:

The algebraic connectivity of a graph is defined as the second smallest eigenvalue of the Laplacian matrix of the graph, which is a parameter to measure how well a graph is connected. In this paper, we present two unique graphs whose algebraic connectivity attain the minimum among all graphs whose complements are trees, but not stars, and among all graphs whose complements are unicyclic graphs, but not stars adding one edge, respectively.

APA, Harvard, Vancouver, ISO, and other styles

37

Shi, Xiaolong, Saeed Kosari, Saira Hameed, Abdul Ghafar Shah, and Samee Ullah. "Application of connectivity index of cubic fuzzy graphs for identification of danger zones of tsunami threat." PLOS ONE 19, no. 1 (2024): e0297197. http://dx.doi.org/10.1371/journal.pone.0297197.

Full text

Abstract:

Fuzzy graphs are very important when we are trying to understand and study complex systems with uncertain and not exact information. Among different types of fuzzy graphs, cubic fuzzy graphs are special due to their ability to represent the membership degree of both vertices and edges using intervals and fuzzy numbers, respectively. To figure out how things are connected in cubic fuzzy graphs, we need to know about cubic α−strong, cubic β−strong and cubic δ−weak edges. These concepts better help in making decisions, solving problems and analyzing things like transportation, social networks and

APA, Harvard, Vancouver, ISO, and other styles

38

Razi, Adeel, Mohamed L. Seghier, Yuan Zhou, et al. "Large-scale DCMs for resting-state fMRI." Network Neuroscience 1, no. 3 (2017): 222–41. http://dx.doi.org/10.1162/netn_a_00015.

Full text

Abstract:

This paper considers the identification of large directed graphs for resting-state brain networks based on biophysical models of distributed neuronal activity, that is, effective connectivity. This identification can be contrasted with functional connectivity methods based on symmetric correlations that are ubiquitous in resting-state functional MRI (fMRI). We use spectral dynamic causal modeling (DCM) to invert large graphs comprising dozens of nodes or regions. The ensuing graphs are directed and weighted, hence providing a neurobiologically plausible characterization of connectivity in term

APA, Harvard, Vancouver, ISO, and other styles

39

Ibraheem, Muhammad, Ebenezer Bonyah, and Muhammad Javaid. "Sum-Connectivity Coindex of Graphs under Operations." Journal of Chemistry 2022 (April 14, 2022): 1–14. http://dx.doi.org/10.1155/2022/4523223.

Full text

Abstract:

Topological indices or coindices are mathematical parameters which are widely used to investigate different properties of graphs. The operations on graphs play vital roles in the formation of new molecular graphs from the old ones. Let Γ be a graph we perform four operations which are S , R , Q , and T and obtained subdivisions type graphs such that S Γ , R Γ , Q Γ , and T Γ , respectively. Let Γ 1 and Γ 2 be two simple graphs; then, F -sum graph is defined by performing the Cartesian product on F Γ 1 and Γ 2 ; mathematically, it is denoted by Γ 1 + F Γ 2 , where F ∈ S , R , Q , T . In this ar

APA, Harvard, Vancouver, ISO, and other styles

40

Binu, M., Sunil Mathew, and J. N. Mordeson. "Connectivity status of fuzzy graphs." Information Sciences 573 (September 2021): 382–95. http://dx.doi.org/10.1016/j.ins.2021.05.068.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Liu, Runrun, Martin Rolek, D. Christopher Stephens, Dong Ye, and Gexin Yu. "Connectivity for Kite-Linked Graphs." SIAM Journal on Discrete Mathematics 35, no. 1 (2021): 431–46. http://dx.doi.org/10.1137/19m130282x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Matsumoto, Naoki, and Tomoki Nakamigawa. "Game edge-connectivity of graphs." Discrete Applied Mathematics 298 (July 2021): 155–64. http://dx.doi.org/10.1016/j.dam.2021.04.005.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Mathew, Sunil, and M. S. Sunitha. "Cycle connectivity in weighted graphs." Proyecciones (Antofagasta) 30, no. 1 (2011): 1–17. http://dx.doi.org/10.4067/s0716-09172011000100001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Mathew, Sunil, and M. S. Sunitha. "Cycle connectivity in fuzzy graphs." Journal of Intelligent & Fuzzy Systems 24, no. 3 (2013): 549–54. http://dx.doi.org/10.3233/ifs-2012-0573.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Jin, Zemin, Xueliang Li, and Kaijun Wang. "The Monochromatic Connectivity of Graphs." Taiwanese Journal of Mathematics 24, no. 4 (2020): 785–815. http://dx.doi.org/10.11650/tjm/200102.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Liu, Hongjuan, and Honghai Li. "Normalized algebraic connectivity of graphs." Discrete Mathematics, Algorithms and Applications 11, no. 03 (2019): 1950031. http://dx.doi.org/10.1142/s1793830919500319.

Full text

Abstract:

Let [Formula: see text] be the second smallest normalized Laplacian eigenvalue of a graph [Formula: see text], called the normalized algebraic connectivity of [Formula: see text]. In this paper, we study the relation between the normalized algebraic connectivity of the coalescence of two graphs and that of these two graphs. Furthermore, we investigate how the normalized algebraic connectivity behaves when the graph is perturbed by relocating pendent edges.

APA, Harvard, Vancouver, ISO, and other styles

47

Caporossi, Gilles, Ivan Gutman, Pierre Hansen, and Ljiljana Pavlović. "Graphs with maximum connectivity index." Computational Biology and Chemistry 27, no. 1 (2003): 85–90. http://dx.doi.org/10.1016/s0097-8485(02)00016-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Knor, Martin, and L'udovı́t Niepel. "Connectivity of iterated line graphs." Discrete Applied Mathematics 125, no. 2-3 (2003): 255–66. http://dx.doi.org/10.1016/s0166-218x(02)00197-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Erdös, P., and J. W. Kennedy. "k-Connectivity in Random Graphs." European Journal of Combinatorics 8, no. 3 (1987): 281–86. http://dx.doi.org/10.1016/s0195-6698(87)80032-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Uchizawa, Kei, Takanori Aoki, Takehiro Ito, and Xiao Zhou. "Generalized rainbow connectivity of graphs." Theoretical Computer Science 555 (October 2014): 35–42. http://dx.doi.org/10.1016/j.tcs.2014.01.007.

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!