Relevant bibliographies by topics / Disconnected graph

Contents

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

Academic literature on the topic 'Disconnected graph'

Author: Grafiati
Published: 7 June 2025
Last updated: 2 August 2025

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 'Disconnected graph.'

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 "Disconnected graph"

1

Gayathri, R. Om, and R. Hemavathy. "Fixed Point Theorems for Non-self Mappings Using Disconnected Graphs." Indian Journal Of Science And Technology 17, no. 7 (2024): 643–50. http://dx.doi.org/10.17485/ijst/v17i7.2497.

Full text
Abstract:
Objectives: To prove the fixed point theorems for non-self mappings using disconnected graphs. Method: Graph theoretical approach is adopted to prove the fixed point theorems for non-self mappings. In all the previous works, connected graphs were used for establishing the results, but it is demonstrated in this work that disconnected graphs are best suited, and this new approach simplifies the proofs to a greater extent. Findings: The fixed point theorems by Banach, Kannan, Chatterjea, and Bianchini are proved using the new methodology. Novelty: An important part of the results concerning fixe
APA, Harvard, Vancouver, ISO, and other styles
2

Nikoghosyan, Zh G. "Disconnected Forbidden Subgraphs, Toughness and Hamilton Cycles." ISRN Combinatorics 2013 (March 10, 2013): 1–4. http://dx.doi.org/10.1155/2013/673971.

Full text
Abstract:
In 1974, Goodman and Hedetniemi proved that every 2-connected -free graph is hamiltonian. This result gave rise many other conditions for Hamilton cycles concerning various pairs and triples of forbidden connected subgraphs under additional connectivity conditions. In this paper we investigate analogous problems when forbidden subgraphs are disconnected which affects more global structures in graphs such as tough structures instead of traditional connectivity structures. In 1997, it was proved that a single forbidden connected subgraph in 2-connected graphs can create only a trivial class of h
APA, Harvard, Vancouver, ISO, and other styles
3

Nikitin, Filipp, Olexandr Isayev, and Vadim Strijov. "DRACON: disconnected graph neural network for atom mapping in chemical reactions." Physical Chemistry Chemical Physics 22, no. 45 (2020): 26478–86. http://dx.doi.org/10.1039/d0cp04748a.

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

R, Om Gayathri, and Hemavathy R. "Fixed Point Theorems for Non-self Mappings Using Disconnected Graphs." Indian Journal of Science and Technology 17, no. 7 (2024): 643–50. https://doi.org/10.17485/IJST/v17i7.2497.

Full text
Abstract:
Abstract <strong>Objectives:</strong>&nbsp;To prove the fixed point theorems for non-self mappings using disconnected graphs.&nbsp;<strong>Method:</strong>&nbsp;Graph theoretical approach is adopted to prove the fixed point theorems for non-self mappings. In all the previous works, connected graphs were used for establishing the results, but it is demonstrated in this work that disconnected graphs are best suited, and this new approach simplifies the proofs to a greater extent.&nbsp;<strong>Findings:</strong>&nbsp;The fixed point theorems by Banach, Kannan, Chatterjea, and Bianchini are proved
APA, Harvard, Vancouver, ISO, and other styles
5

Kaneria, V. J., H. M. Makadia, and R. V. Viradia. "Graceful Labeling for Disconnected Grid Related Graphs." Bulletin of Mathematical Sciences and Applications 11 (February 2015): 6–11. http://dx.doi.org/10.18052/www.scipress.com/bmsa.11.6.

Full text
Abstract:
In this paper we have proved that union of three grid graphs, U3l=1(Pnl×Pml)and union of finite copies of a grid graph (Pn×Pm)are graceful. We have also given two graceful labeling functions to the grid graph (Pn×Pm).
APA, Harvard, Vancouver, ISO, and other styles
6

BAČA, MARTIN, MIRKA MILLER, JOE RYAN, and ANDREA SEMANIČOVÁ-FEŇOVČÍKOVÁ. "ON -ANTIMAGICNESS OF DISCONNECTED GRAPHS." Bulletin of the Australian Mathematical Society 94, no. 2 (2016): 201–7. http://dx.doi.org/10.1017/s0004972716000204.

Full text
Abstract:
A simple graph $G=(V,E)$ admits an $H$-covering if every edge in $E$ belongs to at least one subgraph of $G$ isomorphic to a given graph $H$. Then the graph $G$ is $(a,d)$-$H$-antimagic if there exists a bijection $f:V\cup E\rightarrow \{1,2,\ldots ,|V|+|E|\}$ such that, for all subgraphs $H^{\prime }$ of $G$ isomorphic to $H$, the $H^{\prime }$-weights, $wt_{f}(H^{\prime })=\sum _{v\in V(H^{\prime })}f(v)+\sum _{e\in E(H^{\prime })}f(e)$, form an arithmetic progression with the initial term $a$ and the common difference $d$. When $f(V)=\{1,2,\ldots ,|V|\}$, then $G$ is said to be super $(a,d)
APA, Harvard, Vancouver, ISO, and other styles
7

Wamiliana, Wamiliana, Amanto Amanto, Mustofa Usman, Muslim Ansori, and Fadila Cahya Puri. "Enumerating the Number of Connected Vertices Labeled Graph of Order Six with Maximum Ten Loops and Containing No Parallel Edges." Science and Technology Indonesia 5, no. 4 (2020): 131. http://dx.doi.org/10.26554/sti.2020.5.4.131-135.

Full text
Abstract:
A Graph G (V, E) is said to be a connected graph if for every two vertices on the graph there exist at least a path connecting them, otherwise, the graph is disconnected. Two edges or more that connect the same pair of vertices are called parallel edges, and an edge that starts and ends at the same vertex is called a loop. A graph is called simple if it containing no loops nor parallel edges. Given n vertices and m edges, m ≥ 1, there are many graphs that can be formed, either connected or disconnected. In this research, we will discuss how to calculate the number of connected vertices labeled
APA, Harvard, Vancouver, ISO, and other styles
8

SUSANTO, FAISAL, KRISTIANA WIJAYA, PRASANTI MIA PURNAMA, and SLAMIN S. "On Distance Irregular Labeling of Disconnected Graphs." Kragujevac Journal of Mathematics 46, no. 4 (2022): 507–23. http://dx.doi.org/10.46793/kgjmat2204.507s.

Full text
Abstract:
A distance irregular k-labeling of a graph G is a function f : V (G) → {1, 2, . . . , k} such that the weights of all vertices are distinct. The weight of a vertex v, denoted by wt(v), is the sum of labels of all vertices adjacent to v (distance 1 from v), that is, wt(v) = P u∈N(v) f(u). If the graph G admits a distance irregular labeling then G is called a distance irregular graph. The distance irregularity strength of G is the minimum k for which G has a distance irregular k-labeling and is denoted by dis(G). In this paper, we derive a new lower bound of distance irregularity strength for gr
APA, Harvard, Vancouver, ISO, and other styles
9

Ansori, Muslim, Wamiliana Wamiliana, Fitriani Fitriani, Yudi Antoni, and Desiana Putri. "Enumerate the Number of Vertices Labeled Connected Graph of Order Seven Containing No Parallel Edges." Science and Technology Indonesia 7, no. 3 (2022): 392–99. http://dx.doi.org/10.26554/sti.2022.7.3.392-399.

Full text
Abstract:
A graph that is connected G(V,E) is a graph in which there is at least one path connecting every two vertices in G; otherwise, it is called a disconnected graph. Labels or values can be assigned to the vertices or edges of a graph. A vertex-labeled graph is one in which only the vertices are labeled, and an edges-labeled graph is one in which only edges are assigned values or labels. If both vertices and edges are labeled, the graph is referred to as total labeling. If given n vertices and m edges, numerous graphs can be made, either connected or disconnected. This study will be discussed the
APA, Harvard, Vancouver, ISO, and other styles
10

Sanli, Utkum, Feriha Celik, Sadik Delen, and Ismail Cangul. "Connectedness criteria for graphs by means of omega invariant." Filomat 34, no. 2 (2020): 647–52. http://dx.doi.org/10.2298/fil2002647s.

Full text
Abstract:
A realizable degree sequence can be realized in many ways as a graph. There are several tests for determining realizability of a degree sequence. Up to now, not much was known about the common properties of these realizations. Euler characteristic is a well-known characteristic of graphs and their underlying surfaces. It is used to determine several combinatorial properties of a surface and of all graphs embedded onto it. Recently, last two authors defined a number ? which is invariant for all realizations of a given degree sequence. ? is shown to be related to Euler characteristic and cycloma
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Disconnected graph"

1

Bywaters, Timothy Peter. "Connections Between Willis' Theory for Totally Disconnected Locally Compact Groups and Graph Automorphisms." Thesis, The University of Sydney, 2019. http://hdl.handle.net/2123/21148.

Full text
Abstract:
We investigate the tidy subgroups, scale function and related invariants of totally disconnected locally compact groups. Our focus is on relating these ideas to combinatorial and geometric aspects of the group. After giving necessary background, we study the scale function and tidy subgroups of an endomorphism of a totally disconnected locally compact group. Our results are inspired by a similar investigation for automorphisms by Möller (Can. J. Math., 54(4), 795-827). We characterise when a compact open subgroup is tidy for an endomorphism in terms of a graph constructed from the subgroups a
APA, Harvard, Vancouver, ISO, and other styles
2

Silalahi, Raphita Yanisari, and 施塔亞. "Antimagic Labelings on Disconnected Graphs." Thesis, 2019. http://ndltd.ncl.edu.tw/handle/pfqmq6.

Full text
Abstract:
碩士<br>國立中興大學<br>應用數學系所<br>107<br>Let G = (V (G), E(G)) with p vertices and q edges, and an edge labeling of G be a bijection f : E(G) → {1,2,...,q}. The (induced) vertex sum φ_f(u) : V(G) → ℕ of the edge labeling f is a function given by φ_f (u) := ∑_(uv∈E(G))f(uv) for all u ∈ V (G). A graph G is called antimagic if there exists an edge labeling of G such that vertex sums are all distinct for all vertices. We call the edge labeling of G is an antimagic labeling of G. Shang [4] conjectured that ”For m ∈ ℕ, the linear forest mP3 ∪ P4 is antimagic if and if m ≤ 2”. The conjecture is showed to be
APA, Harvard, Vancouver, ISO, and other styles
3

Chang, Chi-Nan, and 張吉南. "A Study On Graceful Labelings of Disconnected Graphs." Thesis, 2001. http://ndltd.ncl.edu.tw/handle/92778469461154228156.

Full text
Abstract:
碩士<br>真理大學<br>數理科學研究所<br>89<br>Given a graph G, a graceful labeling f of G is an injection from f:V→{0,1,…,|E|} such that the function f':E→{1,2,3, …,|E|}, defined by f'(uv)=|f(u)-f(v)| for every edge uv in E,is a bijection. In this thesis, we study the graceful labeling for the union of two graphs G1 and G2, where G1 is a path, cycle or P_{a,b} and G2 is a path. We also study graceful labeling for the graph K_{n}\square S_{2^{n-1}- \binom{n}{2}-1}
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Disconnected graph"

1

Freivalds, Karlis, Ugur Dogrusoz, and Paulis Kikusts. "Disconnected Graph Layout and the Polyomino Packing Approach." In Graph Drawing. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45848-4_30.

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

Chen, Zhi-Zhong, and Tatsuie Tsukiji. "Computing Bounded-Degree Phylogenetic Roots of Disconnected Graphs." In Graph-Theoretic Concepts in Computer Science. Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-30559-0_26.

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

Erdem, Aykut, and Sibel Tari. "Coarse-to-Fine Matching of Shapes Using Disconnected Skeletons by Learning Class-Specific Boundary Deformations." In Graph-Based Representations in Pattern Recognition. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-02124-4_3.

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

Hong, Seok-Hee, and Peter Eades. "Symmetric Layout of Disconnected Graphs." In Algorithms and Computation. Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-24587-2_42.

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

Kamiński, Marcin, Daniël Paulusma, Anthony Stewart, and Dimitrios M. Thilikos. "Minimal Disconnected Cuts in Planar Graphs." In Fundamentals of Computation Theory. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-22177-9_19.

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

Marimuthu, G., and P. Krishnaveni. "Super Edge-Antimagic Gracefulness of Disconnected Graphs." In Theoretical Computer Science and Discrete Mathematics. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-64419-6_20.

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

Abueida, Atif, and Kenneth Roblee. "Harmonious Labelings of Disconnected Graphs Involving Cycles and Multiple Components Consisting of Starlike Trees." In Springer Proceedings in Mathematics & Statistics. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-05375-7_10.

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

"Disconnected Graphs." In Lecture Notes in Mathematics. Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-75859-4_18.

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

Belik, Ivan. "Shapley-Based Analysis of the Leadership Formation in Social Networks." In Analytics, Operations, and Strategic Decision Making in the Public Sector. IGI Global, 2019. http://dx.doi.org/10.4018/978-1-5225-7591-7.ch016.

Full text
Abstract:
The dynamic nature of networks formation requires the development of multidisciplinary methods for the effective social network analysis. The research presented in this chapter is motivated by the necessity to overcome the limitation of using analytical methods from the originally disconnected research domains. Hence, the authors present an approach based on techniques from different areas, such as graph theory, theory of algorithms, and game theory. Specifically, this chapter is based on the analysis of how an agent can move towards leadership in real-life socioeconomic networks. For the agen
APA, Harvard, Vancouver, ISO, and other styles
10

Van Woensel, William, Chad Armstrong, Malavan Rajaratnam, Vaibhav Gupta, and Syed Sibte Raza Abidi. "Using Knowledge Graphs to Plausibly Infer Missing Associations in EMR Data." In Studies in Health Technology and Informatics. IOS Press, 2021. http://dx.doi.org/10.3233/shti210192.

Full text
Abstract:
Electronic Medical Records (EMRs) are increasingly being deployed at primary points of care and clinics for digital record keeping, increasing productivity and improving communication. In practice, however, there still exists an often incomplete picture of patient profiles, not only because of disconnected EMR systems but also due to incomplete EMR data entry – often caused by clinician time constraints and lack of data entry restrictions. To complete a patient’s partial EMR data, we plausibly infer missing causal associations between medical EMR concepts, such as diagnoses and treatments, for
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Disconnected graph"

1

Gao, Jun, and Jianliang Gao. "A Similarity Measurement Method Based on Graph Kernel for Disconnected Graphs." In Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/904.

Full text
Abstract:
Disconnected graphs are very common in the real world. However, most existing methods for graph similarity focus on connected graph. In this paper, we propose an effective approach for measuring the similarity of disconnected graphs. By embedding connected subgraphs with graph kernel, we obtain the feature vectors in low dimensional space. Then, we match the subgraphs and weigh the similarity of matched subgraphs. Finally, an intuitive example shows the feasibility of the method.
APA, Harvard, Vancouver, ISO, and other styles
2

Ding, Chris H. Q., Xiaofeng He, and Hongyuan Zha. "A spectral method to separate disconnected and nearly-disconnected web graph components." In the seventh ACM SIGKDD international conference. ACM Press, 2001. http://dx.doi.org/10.1145/502512.502551.

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

Masquio, Bruno, Paulo Pinto, and Jayme Szwarcfiter. "Algoritmos eficientes para emparelhamentos desconexos em grafos cordais e grafos bloco." In IV Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2019. http://dx.doi.org/10.5753/etc.2019.6390.

Full text
Abstract:
Graph matching problems are well studied and bring great contributions to Graph Theory from both the theoretical and practical points of view. There are numerous studies for unrestricted and weighted/unweighted matchings. More recently, subgraph-restricted matchings have been proposed, which consider properties of the subgraph induced by the vertices of the matching. In this paper, we approach one of these new proposals, disconnected matching, which seeks to study maximum matching, such that the subgraph induced by the matching vertices is disconnected. We have described efficient algorithms t
APA, Harvard, Vancouver, ISO, and other styles
4

Mu, Yarong, and Bing Yao. "On Disconnected Topological Graph Passwords for Information Security." In 2018 2nd IEEE Advanced Information Management,Communicates, Electronic and Automation Control Conference (IMCEC). IEEE, 2018. http://dx.doi.org/10.1109/imcec.2018.8469262.

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

Tanveera Sultana, H. M., V. J. Sudhakar, and C. Santhanaraju. "2-odd labeling of some new disconnected graph." In CONTEMPORARY INNOVATIONS IN ENGINEERING AND MANAGEMENT. AIP Publishing, 2023. http://dx.doi.org/10.1063/5.0150566.

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

Zhang, Yufeng, Weiqing Wang, Hongzhi Yin, Pengpeng Zhao, Wei Chen, and Lei Zhao. "Disconnected Emerging Knowledge Graph Oriented Inductive Link Prediction." In 2023 IEEE 39th International Conference on Data Engineering (ICDE). IEEE, 2023. http://dx.doi.org/10.1109/icde55515.2023.00036.

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

De Pellegrini, F., D. Miorandi, I. Carreras, and I. Chlamtac. "A Graph-Based Model for Disconnected Ad Hoc Networks." In IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications. IEEE, 2007. http://dx.doi.org/10.1109/infcom.2007.51.

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

Masquio, Bruno P., Paulo E. D. Pinto, and Jayme L. Szwarcfiter. "Emparelhamentos Conexos." In Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2020. http://dx.doi.org/10.5753/etc.2020.11075.

Full text
Abstract:
Graph matching problems are well known and studied, in which we want to find sets of pairwise non-adjacent edges. Recently, there has been an interest in the study of matchings in which the induced subgraphs by the vertices of matchings are connected or disconnected. Although these problems are related to connectivity, the two problems are probably quite different, regarding their complexity. While the complexity of finding a maximum disconnected mat- ching is still unknown for a general graph, the one for connected matchings can be solved in polynomial time. Our contribution in this paper is
APA, Harvard, Vancouver, ISO, and other styles
9

Zhou, Hong, and Kwun-Lon Ting. "Spanning Tree Based Topological Optimization of Compliant Mechanisms." In ASME 2005 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2005. http://dx.doi.org/10.1115/detc2005-84608.

Full text
Abstract:
In graph theory, spanning trees connect all the vertices together using minimum number of edges. A topological optimization method of compliant mechanisms is presented based on spanning tree theory. A valid topology is regarded as a network connecting input, output, support and intermediate nodes, which contains at least one spanning tree among the introduced nodes. Invalid disconnected topologies can be weeded out if no spanning tree is included. No further deformation analysis and performance evaluation is needed for invalid disconnected topologies. Problem-dependent objectives are optimized
APA, Harvard, Vancouver, ISO, and other styles
10

Wang, Guangtao, Rex Ying, Jing Huang, and Jure Leskovec. "Multi-hop Attention Graph Neural Networks." In Thirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}. International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/ijcai.2021/425.

Full text
Abstract:
Self-attention mechanism in graph neural networks (GNNs) led to state-of-the-art performance on many graph representation learning tasks. Currently, at every layer, attention is computed between connected pairs of nodes and depends solely on the representation of the two nodes. However, such attention mechanism does not account for nodes that are not directly connected but provide important network context. Here we propose Multi-hop Attention Graph Neural Network (MAGNA), a principled way to incorporate multi-hop context information into every layer of attention computation. MAGNA diffuses the
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Disconnected graph"

1

Morin, Shai, Gregory Walker, Linda Walling, and Asaph Aharoni. Identifying Arabidopsis thaliana Defense Genes to Phloem-feeding Insects. United States Department of Agriculture, 2013. http://dx.doi.org/10.32747/2013.7699836.bard.

Full text
Abstract:
The whitefly (Bemisia tabaci) is a serious agricultural pest that afflicts a wide variety of ornamental and vegetable crop species. To enable survival on a great diversity of host plants, whiteflies must have the ability to avoid or detoxify numerous different plant defensive chemicals. Such toxins include a group of insect-deterrent molecules called glucosinolates (GSs), which also provide the pungent taste of Brassica vegetables such as radish and cabbage. In our BARD grant, we used the whitefly B. tabaci and Arabidopsis (a Brassica plant model) defense mutants and transgenic lines, to gain
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Disconnected graph' for particular source types:
Journal articles
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