Log in

Relevant bibliographies by topics / EDGE TEST TREE GRAPH / Journal articles

To see the other types of publications on this topic, follow the link: EDGE TEST TREE GRAPH.

Journal articles on the topic 'EDGE TEST TREE GRAPH'

Author: Grafiati

Published: 11 September 2023

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 'EDGE TEST TREE 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.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Guo, Mingyu, Jialiang Li, Aneta Neumann, Frank Neumann, and Hung Nguyen. "Limited Query Graph Connectivity Test." Proceedings of the AAAI Conference on Artificial Intelligence 38, no. 18 (2024): 20718–25. http://dx.doi.org/10.1609/aaai.v38i18.30059.

Full text

Abstract:

We propose a combinatorial optimisation model called Limited Query Graph Connectivity Test. We consider a graph whose edges have two possible states (On/Off). The edges' states are hidden initially. We could query an edge to reveal its state. Given a source s and a destination t, we aim to test s−t connectivity by identifying either a path (consisting of only On edges) or a cut (consisting of only Off edges). We are limited to B queries, after which we stop regardless of whether graph connectivity is established. We aim to design a query policy that minimizes the expected number of queries. Ou

APA, Harvard, Vancouver, ISO, and other styles

2

Wei, Yuxuan, Zhinan Gao, and Xingyan Lu. "The Complexity of Wheel Graphs with Multiple Edges and Vertices." Asian Research Journal of Mathematics 19, no. 9 (2023): 1–12. http://dx.doi.org/10.9734/arjom/2023/v19i9694.

Full text

Abstract:

In this paper, we focus on calculate the number of spanning trees of the general wheel graphs, which meansthe original wheel graphs adding large amount of vertices and edges. Particularly, we introduce the C-graphand deduce a new equation that computing the spanning trees by removing C-graphs instead of edges.In Addition, we test our results by Kirchhoff’s matrix-tree theorem in some simple cases and provide thetree entropy of the general wheel graphs. Finally, we analyse the relation between the wheel graph anddouble-wheel graphs and propose the idea of calculating the spanning trees of doubl

APA, Harvard, Vancouver, ISO, and other styles

3

Dhanashri Korpad, Nisha Satpute, Nayana Joshi, Snehal Kulkarni, Komal Walgude, and Neha Dhadiwal. "Numerical Data Processing by The Implementation of Trees and Graphs." International Research Journal on Advanced Engineering and Management (IRJAEM) 2, no. 11 (2024): 3256–60. http://dx.doi.org/10.47392/irjaem.2024.0479.

Full text

Abstract:

Trees and Graphs play a vital role in transport and logistics. In tree, decision tree is one of the important, not only implemented for data processing, but also considered for Numerical data analysis. The decision tree is a flow chart-like structure, in which each internal node represents a ‘test’ on an attribute, which has a node known as root being at the top, which further divides the given data into branches depending upon the conditions. Every branch consists of a rule, and each leaf node is its outcome. A support tool with a tree-like structure that models probable outcomes, cost of res

APA, Harvard, Vancouver, ISO, and other styles

4

Wamiliana, Wamiliana. "SOLVING THE DEGREE CONSTRAINED MINIMUM SPANNING TREE PROBLEM USING TABU AND MODIFIED PENALTY SEARCH METHODS." Jurnal Teknik Industri 6, no. 1 (2005): 1–9. http://dx.doi.org/10.9744/jti.6.1.1-9.

Full text

Abstract:

In this paper we consider the Degree Constrained Minimum Spanning Tree Problem. This problem is concerned with finding, in a given edge weighted graph G (all weights are non-negative), the minimum weight spanning tree T satisfying specified degree restrictions on the vertices. This problem arises naturally in communication networks where the degree of a vertex represents the number of line interfaces available at a center. Because of its NP-completeness, a number of heuristics have been proposed. In this paper we propose two new search methods: one based on the method of Tabu search and the ot

APA, Harvard, Vancouver, ISO, and other styles

5

Batsamut, V. M., S. O. Hodlevsky, Yu P. Babkov, and D. A. Morkvin. "METHOD OF CREATING A MINIMAL SPANNING TREE ON AN ARBITRARY SUBSET OF VERTICES OF A WEIGHTED UNDIRECTED GRAPH." Radio Electronics, Computer Science, Control, no. 1 (April 2, 2024): 188. http://dx.doi.org/10.15588/1607-3274-2024-1-17.

Full text

Abstract:

Context. The relevance of the article is determined by the need for further development of models for optimal restoration of the connectivity of network objects that have undergone fragmentation due to emergency situations of various origins. The method proposed in this article solves the problematic situation of minimizing the amount of restoration work (total financial costs) when promptly restoring the connectivity of a selected subset of elements of a network object after its fragmentation. The purpose of the study is to develop a method for creating a minimal spanning tree on an arb

APA, Harvard, Vancouver, ISO, and other styles

6

Zhong, Shuaihao, Duoqiang Wang, Wei Li, Feng Lu, and Hai Jin. "Burner: Recipe Automatic Generation for HPC Container Based on Domain Knowledge Graph." Wireless Communications and Mobile Computing 2022 (May 25, 2022): 1–14. http://dx.doi.org/10.1155/2022/4592428.

Full text

Abstract:

As one of the emerging cloud computing technologies, containers are widely used in academia and industry. The cloud computing built by the container in the high performance computing (HPC) center can provide high-quality services to users at the edge. Singularity Definition File and Dockerfile (we refer to such files as recipes) have attracted wide attention due to their encapsulation of the application running environment in a container. However, creating a recipe requires extensive domain knowledge, which is error-prone and time-consuming. Accordingly, more than 34% of Dockerfiles in Github

APA, Harvard, Vancouver, ISO, and other styles

7

Gilani, S. A. N., M. Awrangjeb, and G. Lu. "FUSION OF LIDAR DATA AND MULTISPECTRAL IMAGERY FOR EFFECTIVE BUILDING DETECTION BASED ON GRAPH AND CONNECTED COMPONENT ANALYSIS." ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences XL-3/W2 (March 10, 2015): 65–72. http://dx.doi.org/10.5194/isprsarchives-xl-3-w2-65-2015.

Full text

Abstract:

Building detection in complex scenes is a non-trivial exercise due to building shape variability, irregular terrain, shadows, and occlusion by highly dense vegetation. In this research, we present a graph based algorithm, which combines multispectral imagery and airborne LiDAR information to completely delineate the building boundaries in urban and densely vegetated area. In the first phase, LiDAR data is divided into two groups: ground and non-ground data, using ground height from a bare-earth DEM. A mask, known as the primary building mask, is generated from the non-ground LiDAR points where

APA, Harvard, Vancouver, ISO, and other styles

8

Chimani, Markus, Giuseppe Di Battista, Fabrizio Frati, and Karsten Klein. "Advances on Testing C-Planarity of Embedded Flat Clustered Graphs." International Journal of Foundations of Computer Science 30, no. 02 (2019): 197–230. http://dx.doi.org/10.1142/s0129054119500011.

Full text

Abstract:

In this paper, we show a polynomial-time algorithm for testing [Formula: see text]-planarity of embedded flat clustered graphs with at most two vertices per cluster on each face. Our result is based on a reduction to the planar set of spanning trees in topological multigraphs (pssttm) problem, which is defined as follows. Given a (non-planar) topological multigraph [Formula: see text] with [Formula: see text] connected components [Formula: see text], do spanning trees of [Formula: see text] exist such that no two edges in any two spanning trees cross? Kratochvíl et al. [SIAM Journal on Discret

APA, Harvard, Vancouver, ISO, and other styles

9

Bu, Weijun. "Data or mathematics? Solutions to semantic problems in artificial intelligence." Journal of Computational Methods in Sciences and Engineering 24, no. 4-5 (2024): 2847–61. http://dx.doi.org/10.3233/jcm-247520.

Full text

Abstract:

Data support is already driving the development of artificial intelligence. But it cannot solve the semantic problem of artificial intelligence. This requires improving the semantic understanding ability of artificial intelligence. Therefore, a question answering system based on semantic problem processing is proposed in this study. The question answering system utilizes an improved unsupervised method to extract keywords. This technology integrates the semantic feature information of text into traditional word graph model algorithms. On this basis, semantic similarity information is used to c

APA, Harvard, Vancouver, ISO, and other styles

10

Abbasi, Mozhgan, Jochem Verrelst, Mohsen Mirzaei, Safar Marofi, and Hamid Reza Riyahi Bakhtiari. "Optimal Spectral Wavelengths for Discriminating Orchard Species Using Multivariate Statistical Techniques." Remote Sensing 12, no. 1 (2019): 63. http://dx.doi.org/10.3390/rs12010063.

Full text

Abstract:

Sustainable management of orchard fields requires detailed information about the tree types, which is a main component of precision agriculture programs. To this end, hyperspectral imagery can play a major role in orchard tree species mapping. Efficient use of hyperspectral data in combination with field measurements requires the development of optimized band selection strategies to separate tree species. In this study, field spectroscopy (350 to 2500 nm) was performed through scanning 165 spectral leaf samples of dominant orchard tree species (almond, walnut, and grape) in Chaharmahal va Bakh

APA, Harvard, Vancouver, ISO, and other styles

11

Spatharis, Anthony, Ilias Foudalis, Martha Sideri, and Christos Papadimitriou. "Comparing Trade-off Based Models of the Internet." Fundamenta Informaticae 92, no. 4 (2009): 363–72. https://doi.org/10.3233/fun-2009-92403.

Full text

Abstract:

We introduce and evaluate several new models of network growth. Our models are extensions of the FKP model, modifying and improving it in various dimensions. In all these models nodes arrive one by one, and each node is connected to previous nodes by optimizing a trade-off between a geometric objective ("last mile cost") and a topological objective ("position in the network"). Our new models differ from the original FKP model in directions inspired by the real Internet: two or more edges are attached to each arriving node (while the FKP model produces a tree); these edges are chosen according

APA, Harvard, Vancouver, ISO, and other styles

12

Raghavan, S., and Rui Zhang. "Influence Maximization with Latency Requirements on Social Networks." INFORMS Journal on Computing 34, no. 2 (2022): 710–28. http://dx.doi.org/10.1287/ijoc.2021.1095.

Full text

Abstract:

Targeted marketing strategies are of significant interest in the smartapp economy. Typically, one seeks to identify individuals to strategically target in a social network so that the network is influenced at a minimal cost. In many practical settings, the effects of direct influence predominate, leading to the positive influence dominating set with partial payments (PIDS-PP) problem that we discuss in this paper. The PIDS-PP problem is NP-complete because it generalizes the dominating set problem. We discuss several mixed integer programming formulations for the PIDS-PP problem. First, we des

APA, Harvard, Vancouver, ISO, and other styles

13

Fujita, Takaaki. "Novel Idea on Edge-Ultrafilter and Edge-Tangle." Asian Research Journal of Mathematics 20, no. 4 (2024): 18–22. http://dx.doi.org/10.9734/arjom/2024/v20i4794.

Full text

Abstract:

The study of width parameters holds significant interest in both graph theory and algebraic settings. Among these, the tree-cut decomposition stands out as a key metric. The "Edge-tangle" concept is closely related to the "tree-cut width" width parameter in graph theory. This obstruction is often seen as vital for creating effective algorithms to calculate graph width, with the edge-tangle being the specific obstruction for tree-cut width. Meanwhile, the idea of an "Ultrafilter" is well-established in topology and algebra. Due to their versatile nature, ultrafilters hold significant and broad-

APA, Harvard, Vancouver, ISO, and other styles

14

Gurski, Frank, and Robin Weishaupt. "The Behavior of Tree-Width and Path-Width Under Graph Operations and Graph Transformations." Algorithms 18, no. 7 (2025): 386. https://doi.org/10.3390/a18070386.

Full text

Abstract:

Tree-width and path-width are well-known graph parameters. Many NP-hard graph problems admit polynomial-time solutions when restricted to graphs of bounded tree-width or bounded path-width. In this work, we study the behavior of tree-width and path-width under various unary and binary graph transformations. For considered transformations, we provide upper and lower bounds for the tree-width and path-width of the resulting graph in terms of those of the initial graphs or argue why such bounds are impossible to specify. Among the studied unary transformations are vertex addition, vertex deletion

APA, Harvard, Vancouver, ISO, and other styles

15

Zhang, Zhijun, Muhammad Awais Umar, Xiaojun Ren, Basharat Rehman Ali, Mujtaba Hussain, and Xiangmei Li. "Tree-Antimagicness of Web Graphs and Their Disjoint Union." Mathematical Problems in Engineering 2020 (April 9, 2020): 1–6. http://dx.doi.org/10.1155/2020/4565829.

Full text

Abstract:

In graph theory, the graph labeling is the assignment of labels (represented by integers) to edges and/or vertices of a graph. For a graph G=V,E, with vertex set V and edge set E, a function from V to a set of labels is called a vertex labeling of a graph, and the graph with such a function defined is called a vertex-labeled graph. Similarly, an edge labeling is a function of E to a set of labels, and in this case, the graph is called an edge-labeled graph. In this research article, we focused on studying super ad,d-T4,2-antimagic labeling of web graphs W2,n and isomorphic copies of their disj

APA, Harvard, Vancouver, ISO, and other styles

16

Haghir Chehreghani, Morteza. "Unsupervised representation learning with Minimax distance measures." Machine Learning 109, no. 11 (2020): 2063–97. http://dx.doi.org/10.1007/s10994-020-05886-4.

Full text

Abstract:

Abstract We investigate the use of Minimax distances to extract in a nonparametric way the features that capture the unknown underlying patterns and structures in the data. We develop a general-purpose and computationally efficient framework to employ Minimax distances with many machine learning methods that perform on numerical data. We study both computing the pairwise Minimax distances for all pairs of objects and as well as computing the Minimax distances of all the objects to/from a fixed (test) object. We first efficiently compute the pairwise Minimax distances between the objects, using

APA, Harvard, Vancouver, ISO, and other styles

17

Sultana, Razia. "An Algorithm for Solving Minimum Edge-Ranking Spanning Tree Problem on Partial K-Trees." DIU Journal of Science & Technology 4, no. 1 (2024): 1–8. https://doi.org/10.5281/zenodo.13690953.

Full text

Abstract:

An edge-ranking of a graph G is a labeling of its edges with positive integers such that every path between two edges with the same label i contains an intermediate edge with label j>i. The minimum edge-ranking spanning tree problem is to find a spanning tree of a graph G whose edge-ranking needs least number of ranks. In this paper, we present an algorithm to solve the minimum edge-ranking spanning tree problem on a partial k-tree G in O(n2∆(k+1)+2 ∆k(k+1)+2 log2k(k+1)+2n) time, where n is the number of vertices, ∆ is the maximum vertex degree of the graph G and k is bounded by a constant

APA, Harvard, Vancouver, ISO, and other styles

18

Toyonaga, Kenji. "The location of classified edges due to the change in the geometric multiplicity of an eigenvalue in a tree." Special Matrices 7, no. 1 (2019): 257–62. http://dx.doi.org/10.1515/spma-2019-0019.

Full text

Abstract:

Abstract Given a combinatorially symmetric matrix A whose graph is a tree T and its eigenvalues, edges in T can be classified in four categories, based upon the change in geometric multiplicity of a particular eigenvalue, when the edge is removed. We investigate a necessary and sufficient condition for each classification of edges. We have similar results as the case for real symmetric matrices whose graph is a tree. We show that a g-2-Parter edge, a g-Parter edge and a g-downer edge are located separately from each other in a tree, and there is a g-neutral edge between them. Furthermore, we s

APA, Harvard, Vancouver, ISO, and other styles

19

Mary, Francis Remigius Perpetua, Swaminathan Mohanaselvi, and Said Broumi. "A solution approach to minimum spanning tree problem under fermatean fuzzy environment." Bulletin of Electrical Engineering and Informatics 12, no. 3 (2023): 1738–46. http://dx.doi.org/10.11591/eei.v12i3.4794.

Full text

Abstract:

In classical graph theory, the minimal spanning tree (MST) is a subgraph with no cycles that connects each vertex with minimum edge weights. Calculating minimum spanning tree of a graph has always been a common problem throughout ages. Fuzzy minimum spanning tree (FMST) is able to handle uncertainty existing in edge weights for a fuzzy graph which occurs in real world situations. In this article, we have studied the MST problem of a directed and undirected fuzzy graph whose edge weights are represented by fermatean fuzzy numbers (FFN). We focus on determining an algorithmic approach for solvin

APA, Harvard, Vancouver, ISO, and other styles

20

Smirnov, Alexander V. "The Spanning Tree of a Divisible Multiple Graph." Modeling and Analysis of Information Systems 25, no. 4 (2018): 388–401. http://dx.doi.org/10.18255/1818-1015-2018-4-388-401.

Full text

Abstract:

In this paper, we study undirected multiple graphs of any natural multiplicity k > 1. There are edges of three types: ordinary edges, multiple edges and multi-edges. Each edge of the last two types is a union of k linked edges, which connect 2 or k + 1 vertices, correspondingly. The linked edges should be used simultaneously. If a vertex is incident to a multiple edge, it can be also incident to other multiple edges, and it can be the common ending vertex to k linked edges of a multi-edge. If a vertex is the common end of some multi-edge, it cannot be the common end of any other multi-edge.

APA, Harvard, Vancouver, ISO, and other styles

21

Francis, Remigius Perpetua Mary, Mohanaselvi Swaminathan, and Broumi Said. "A solution approach to minimum spanning tree problem under fermatean fuzzy environment." Bulletin of Electrical Engineering and Informatics 12, no. 3 (2023): 1738~1746. https://doi.org/10.11591/eei.v12i3.4794.

Full text

Abstract:

In classical graph theory, the minimal spanning tree (MST) is a subgraph with no cycles that connects each vertex with minimum edge weights. Calculating minimum spanning tree of a graph has always been a common problem throughout ages. Fuzzy minimum spanning tree (FMST) is able to handle uncertainty existing in edge weights for a fuzzy graph which occurs in real world situations. In this article, we have studied the MST problem of a directed and undirected fuzzy graph whose edge weights are represented by fermatean fuzzy numbers (FFN). We focus on determining an algorithmic approach for solvin

APA, Harvard, Vancouver, ISO, and other styles

22

Koch, Ivo, Nina Pardal, and Vinicius Fernandes dos Santos. "Edge deletion to tree-like graph classes." Discrete Applied Mathematics 348 (May 2024): 122–31. http://dx.doi.org/10.1016/j.dam.2024.01.028.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Lourdusamy, A., F. Joy Beaula, and F. Patrick. "Total absolute difference edge irregularity strength of Tp-tree graphs." Proyecciones (Antofagasta) 42, no. 6 (2023): 1597–614. http://dx.doi.org/10.22199/issn.0717-6279-5411.

Full text

Abstract:

A total labeling ξ is defined to be an edge irregular total absolute difference k-labeling of the graph G if for every two different edges e and f of G there is wt(e) 6= wt(f) where weight of an edge e = xy is defined as wt(e) = |ξ(e) − ξ(x) − ξ(y)|. The minimum k for which the graph G has an edge irregular total absolute difference labeling is called the total absolute difference edge irregularity strength of the graph G, tades(G). In this paper, we determine the total absolute difference edge irregularity strength of the precise values for Tp-tree related graphs.

APA, Harvard, Vancouver, ISO, and other styles

24

Smirnov, Alexander Valeryevich. "NP-completeness of the Minimum Spanning Tree Problem of a Multiple Graph of Multiplicity k ≥ 3." Modeling and Analysis of Information Systems 28, no. 1 (2021): 22–37. http://dx.doi.org/10.18255/1818-1015-2021-1-22-37.

Full text

Abstract:

In this paper, we study undirected multiple graphs of any natural multiplicity k > 1. There are edges of three types: ordinary edges, multiple edges and multi-edges. Each edge of the last two types is a union of k linked edges, which connect 2 or (k + 1) vertices correspondingly. The linked edges should be used simultaneously. If a vertex is incident to a multiple edge, it can be also incident to other multiple edges and it can be the common end of k linked edges of some multi-edge. If a vertex is the common end of some multi-edge, it cannot be the common end of another multi-edge. A multip

APA, Harvard, Vancouver, ISO, and other styles

25

Xu, Lantian, Dong Wen, Lu Qin, Ronghua Li, Ying Zhang, and Xuemin Lin. "Constant-time Connectivity Querying in Dynamic Graphs." Proceedings of the ACM on Management of Data 2, no. 6 (2024): 1–23. https://doi.org/10.1145/3698805.

Full text

Abstract:

Connectivity query processing is a fundamental problem in graph processing. Given an undirected graph and two query vertices, the problem aims to identify whether they are connected via a path. Given frequent edge updates in real graph applications, in this paper, we study connectivity query processing in fully dynamic graphs, where edges are frequently inserted or deleted. A recent solution, called D-tree, maintains a spanning tree for each connected component and applies several heuristics to reduce the depth of the tree. To improve the efficiency, we propose a new spanning-tree-based soluti

APA, Harvard, Vancouver, ISO, and other styles

26

Fujita, Takaaki. "Discussion on Maximal Edge-ideal in Graph Theory." Asian Research Journal of Mathematics 21, no. 3 (2025): 118–29. https://doi.org/10.9734/arjom/2025/v21i3904.

Full text

Abstract:

The exploration of width parameters within the fields of graph theory and algebra has garnered significant interest. Among these parameters, tree-cut decomposition stands out as a vital metric. The "Edge-Tangle" concept is intrinsically linked to the width parameter known as "tree-cut width" in graph theory. In this paper, we introduce a new definition termed Maximal Edge-Ideal for graphs and demonstrate their equivalence to Edge-Tangles.

APA, Harvard, Vancouver, ISO, and other styles

27

Triyani, Triyani, and Irham Taufiq. "BEBERAPA SIFAT HIMPUNAN KRITIS PADA PELABELAN AJAIB GRAF BANANA TREE." Jurnal Ilmiah Matematika dan Pendidikan Matematika 4, no. 2 (2012): 271. http://dx.doi.org/10.20884/1.jmp.2012.4.2.2963.

Full text

Abstract:

A critical set in edge magic total labeling on graph G is a subset label such that it can forms the edge magic total labeling uniquely. This paper investigate critical set on Banana Tree graph. The result shows some properties of critical set on Banana Tree graph, such as the size of it at least , where n is number of leaf and k is number of star, except the size of critical set on graph BT(1,1) is 2. Beside it, if x is the label of any leaf and y is the label of the edge adjacent to it then each critical set in λ must contain either x or y, not both.

APA, Harvard, Vancouver, ISO, and other styles

28

Jr., Isagani S. Cabahug,. "On Spanning Tree Packing Number of the Complement of Generalized Petersen Graph and Cocktail Party Graph." Asian Research Journal of Mathematics 19, no. 9 (2023): 226–32. http://dx.doi.org/10.9734/arjom/2023/v19i9714.

Full text

Abstract:

For any graph G, the spanning tree packing number of \(\sigma\) (G), is the maximum number of edge-disjoint spanning trees contained in G. In this study, we determined the maximum number of edge-disjoint spanning trees of the generalized petersen graph and cocktail graph.

APA, Harvard, Vancouver, ISO, and other styles

29

V.Ramachandran and C.Sekar. "ONE MODULO N GRACEFULNESS OF REGULAR BAMBOO TREE AND COCONUT TREE." International journal on applications of graph theory in wireless ad hoc networks and sensor networks (GRAPH-HOC) 6, no. 2 (2014): 1–10. https://doi.org/10.5281/zenodo.3532228.

Full text

Abstract:

A function f is called a graceful labelling of a graph G with q edges if f is an injection from the vertices of G to the set {0, 1, 2, . . . , q} such that, when each edge xy is assigned the label |f(x) − f(y)| , the resulting edge labels are distinct. A graph G is said to be one modulo N graceful (where N is a positive integer) if there is a function φ from the vertex set of G to {0, 1,N, (N + 1), 2N, (2N + 1), . . . ,N(q − 1),N(q − 1) + 1} in such a way that (i) φ is 1 − 1 (ii) φ induces a bijection φ_ from the edge set of G to {1,N + 1, 2N + 1, . . .

APA, Harvard, Vancouver, ISO, and other styles

30

G. Keerthi. "Comparing Machine Learning Algorithms: A Graph Theory Approach for Improving Accuracy." Communications on Applied Nonlinear Analysis 31, no. 8s (2024): 1059–72. https://doi.org/10.52783/cana.v31.5777.

Full text

Abstract:

Graph theory provides a robust framework for modelling complex relationships in medical data, enhancing classification accuracy through relational learning. Unlike traditional machine learning (ML) models that treat data points independently, graph-based approaches support structural dependencies to improve feature representation. This study explores the application of Graph Attention Networks (GAT), GraphSAGE, Graph Convolutional Network(GCN) and Graph Isomorphism Network (GIN) for breast cancer classification, employing k-nearest neighbor (KNN) graphs to construct a structured dataset where

APA, Harvard, Vancouver, ISO, and other styles

31

Yadav, RN. "Signed graphs connected with the root lattice." BIBECHANA 11 (May 10, 2014): 157–60. http://dx.doi.org/10.3126/bibechana.v11i0.10396.

Full text

Abstract:

For any base of the root lattice (An) we can construct a signed graph. A signed graph is one whose edges are signed by +1 or -1. A signed graph is balanced if and only if its vertex set can be divided into two sets-either of which may be empty–so that each edge between the sets is negative and each edge within a set is positive. For a given signed graph Tsaranov, Siedel and Cameron constructed the corresponding root lattice. In the present work we have dealt with signed graphs corresponding to the root lattice An. A connected graph is called a Fushimi tree if its all blocks are complete subgra

APA, Harvard, Vancouver, ISO, and other styles

32

Min, Seunghwan, Sung Gwan Park, Kunsoo Park, Dora Giammarresi, Giuseppe F. Italiano, and Wook-Shin Han. "Symmetric continuous subgraph matching with bidirectional dynamic programming." Proceedings of the VLDB Endowment 14, no. 8 (2021): 1298–310. http://dx.doi.org/10.14778/3457390.3457395.

Full text

Abstract:

In many real datasets such as social media streams and cyber data sources, graphs change over time through a graph update stream of edge insertions and deletions. Detecting critical patterns in such dynamic graphs plays an important role in various application domains such as fraud detection, cyber security, and recommendation systems for social networks. Given a dynamic data graph and a query graph, the continuous subgraph matching problem is to find all positive matches for each edge insertion and all negative matches for each edge deletion. The state-of-the-art algorithm TurboFlux uses a sp

APA, Harvard, Vancouver, ISO, and other styles

33

Prasad, K. C. Rajendra, Venkanagouda M. Goudar, and K. M. Niranjan. "Pathos edge semi-middle graph of a tree." Malaya Journal of Matematik 8, no. 4 (2020): 2190–93. http://dx.doi.org/10.26637/mjm0804/0148.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Bianchi, Maria Paola, Hans-Joachim Böckenhauer, Tatjana Brülisauer, Dennis Komm, and Beatrice Palano. "Online Minimum Spanning Tree with Advice." International Journal of Foundations of Computer Science 29, no. 04 (2018): 505–27. http://dx.doi.org/10.1142/s0129054118410034.

Full text

Abstract:

In the online minimum spanning tree problem, a graph is revealed vertex by vertex; together with every vertex, all edges to vertices that are already known are given, and an online algorithm must irrevocably choose a subset of them as a part of its solution. The advice complexity of an online problem is a means to quantify the information that needs to be extracted from the input to achieve good results. For a graph of size [Formula: see text], we show an asymptotically tight bound of [Formula: see text] on the number of advice bits to produce an optimal solution for any given graph. For parti

APA, Harvard, Vancouver, ISO, and other styles

35

Yang, Jed. "Some NP-complete Edge Packing and Partitioning Problems in Planar Graphs." Communications on Number Theory and Combinatorial Theory 3, no. 1 (2022): 1–8. http://dx.doi.org/10.70013/m9rx1zq8.

Full text

Abstract:

Graph packing and partitioning problems have been studied in many contexts, including from the algorithmic complexity perspective. Consider the packing problem of determining whether a graph contains a spanning tree and a cycle that do not share edges. Bernáth and Király proved that this decision problem is NP-complete and asked if the same result holds when restricting to planar graphs. Similarly, they showed that the packing problem with a spanning tree and a path between two distinguished vertices is NP-complete. They also established the NP-completeness of the partitioning problem of deter

APA, Harvard, Vancouver, ISO, and other styles

36

Rajasekaran, Sanguthevar. "On the Euclidean Minimum Spanning Tree Problem." Computing Letters 1, no. 1 (2005): 11–14. http://dx.doi.org/10.1163/1574040053326325.

Full text

Abstract:

Given a weighted graph G(V;E), a minimum spanning tree for G can be obtained in linear time using a randomized algorithm or nearly linear time using a deterministic algorithm. Given n points in the plane, we can construct a graph with these points as nodes and an edge between every pair of nodes. The weight on any edge is the Euclidean distance between the two points. Finding a minimum spanning tree for this graph is known as the Euclidean minimum spanning tree problem (EMSTP). The minimum spanning tree algorithms alluded to before will run in time O(n2) (or nearly O(n2)) on this graph. In thi

APA, Harvard, Vancouver, ISO, and other styles

37

Meddah, Nacéra, and Mustapha Chellali. "Edges contained in all or in no minimum edge dominating set of a tree." Discrete Mathematics, Algorithms and Applications 11, no. 04 (2019): 1950040. http://dx.doi.org/10.1142/s179383091950040x.

Full text

Abstract:

In a graph, an edge dominates itself and all its adjacent edges. An edge dominating set (EDS) in a graph [Formula: see text] is a subset of edges that dominates every edge of [Formula: see text] In this paper, we characterize edges that are in all or in no minimum EDS in trees.

APA, Harvard, Vancouver, ISO, and other styles

38

Ly Thi Kieu, Diem, and Nguyen Nguyen Phung. "COHEN-MACAULAYNESS OF SOME EDGE-WEIGHTED GRAPHS." Journal of Science Natural Science 67, no. 3 (2022): 17–27. http://dx.doi.org/10.18173/2354-1059.2022-0037.

Full text

Abstract:

In this paper, we will study the characterization of Cohen-Macaulayness of some edge-weighted graphs. For cycle and tree edge-weighted graph, we will reprove the characterization of Cohen-Macaulayness of an edge-weighted cycle and an edge-weighted tree due to C.Paulsen and Wagstaff (2013) [1]. Our proof used a criterion of Hochster for Cohen-Macaulayness of a monomial ideal [2].

APA, Harvard, Vancouver, ISO, and other styles

39

S. Muthukkumar. "Every Tree is an Integral Sum Graph." Communications on Applied Nonlinear Analysis 31, no. 2 (2024): 404–8. http://dx.doi.org/10.52783/cana.v31.586.

Full text

Abstract:

A finite simple graph G is called an integral sum graph (respectively, sum graph) if there is a bijection f from the vertices of G to a set of integers S (respectively, a set of positive integers S) such that uv is an edge of G if and only if f (u)+f (v) ∈ S. In 1999, Liaw et al (Ars Comb., Vol.54, 259-268) posed the conjecture that every tree is an integral sum graph. In this note, we prove that all trees are integral sum graphs. Further, we prove that every bipartite graph is an induced subgraph of a sum graph G with sum number σ(G) = 1.

APA, Harvard, Vancouver, ISO, and other styles

40

Khaing, Zaw Htun. "Spanning Trails Joining Two Given Edges." Bago University Research Journal Vol.7, No.1, no. 2017 (2017): 161–71. https://doi.org/10.5281/zenodo.3909551.

Full text

Abstract:

A trail in G whose first edge is e1 and whose last edge is e2 is called an (e1, e2)-trail for 1 2 e ,e  E(G). An (e1, e2)-trail T is called a spanning (e1, e2)-trail if V (T) = V (G) and if every edge of G is incident with an internal vertex of T. An edge-cut X of a connected graph G is called essential if at least two components of G – X contain at least one edge. In this paper, we prove that if a graph G has two edge-disjoint spanning trees, then either G has a spanning ( 1 2 e ,e )-trail or  1 2 e , e  is an essential edge-cut of a graph G.

APA, Harvard, Vancouver, ISO, and other styles

41

Rasool, Kavi B., Payman A. Rashed, and Ahmed M. Ali. "Relations Between Vertex–Edge Degree Based Topological Indices and Mve-Polynomial of r−Regular Simple Graph." European Journal of Pure and Applied Mathematics 16, no. 2 (2023): 773–83. http://dx.doi.org/10.29020/nybg.ejpam.v16i2.4698.

Full text

Abstract:

One of the more exciting polynomials among the newly presented graph algebraic polynomials is the M−Polynomial, which is a standard method for calculating degree−based topological indices. In this paper, we define the Mve−polynomials based on vertex edge degree and derive various vertex–edge degree based topological indices from them. Thus, for any graph, we provide some relationships between vertex–edge degree topological indices. Also, we discuss the general Mve−polynomial of r−regular simple graph. Finally, we computed the Mve−polynomial of the 2−ary tree graph.

APA, Harvard, Vancouver, ISO, and other styles

42

M, J. Roopa, and Mahantesh K. "Classification and Recognition of Bilingual Text Using Graph Edit Distance Based Degree of Similarity." Indian Journal of Science and Technology 15, no. 27 (2022): 1336–43. https://doi.org/10.17485/IJST/v15i27.2405.

Full text

Abstract:

Abstract <strong>Objectives:</strong> Graph Edit distance-based classification and recognition method is introduced in this study for bilingual characters. Specifically, this method aims to classify characters first and then recognize them in the 2nd level. <strong>Methods:</strong> This study combines both exact graph matching and inexact graph matching techniques to achieve better Recognition. The exact graph matching technique classifies characters by considering the number of vertices and edges as features to classify. Inexact graph matching uses an algorithmic model to meas

APA, Harvard, Vancouver, ISO, and other styles

43

Septory, Brian Juned, Liliek Susilowati, Dafik Dafik, and Veerabhadraiah Lokesha. "On the Study of Rainbow Antimagic Connection Number of Comb Product of Friendship Graph and Tree." Symmetry 15, no. 1 (2022): 12. http://dx.doi.org/10.3390/sym15010012.

Full text

Abstract:

Given a graph G with vertex set V(G) and edge set E(G), for the bijective function f(V(G))→{1,2,⋯,|V(G)|}, the associated weight of an edge xy∈E(G) under f is w(xy)=f(x)+f(y). If all edges have pairwise distinct weights, the function f is called an edge-antimagic vertex labeling. A path P in the vertex-labeled graph G is said to be a rainbow x−y path if for every two edges xy,x′y′∈E(P) it satisfies w(xy)≠w(x′y′). The function f is called a rainbow antimagic labeling of G if there exists a rainbow x−y path for every two vertices x,y∈V(G). We say that graph G admits a rainbow antimagic coloring

APA, Harvard, Vancouver, ISO, and other styles

44

YANHAONA, MUHAMMAD NUR, MD SHAMSUZZOHA BAYZID, and MD SAIDUR RAHMAN. "DISCOVERING PAIRWISE COMPATIBILITY GRAPHS." Discrete Mathematics, Algorithms and Applications 02, no. 04 (2010): 607–23. http://dx.doi.org/10.1142/s1793830910000917.

Full text

Abstract:

Let T be an edge weighted tree, let dT(u, v) be the sum of the weights of the edges on the path from u to v in T, and let d min and d max be two non-negative real numbers such that d min ≤ d max . Then a pairwise compatibility graph of T for d min and d max is a graph G = (V, E), where each vertex u' ∈ V corresponds to a leaf u of T and there is an edge (u', v') ∈ E if and only if d min ≤ dT(u, v) ≤ d max . A graph G is called a pairwise compatibility graph (PCG) if there exists an edge weighted tree T and two non-negative real numbers d min and d max such that G is a pairwise compatibility gr

APA, Harvard, Vancouver, ISO, and other styles

45

Romanuke, Vadim. "Building Minimum Spanning Trees under Maximum Edge Length Constraint." Information Technology and Management Science 26 (November 30, 2023): 17–26. http://dx.doi.org/10.7250/itms-2023-0003.

Full text

Abstract:

Given an initial set of planar nodes, the problem is to build a minimum spanning tree connecting the maximum possible number of nodes by not exceeding the maximum edge length. To obtain a set of edges, a Delaunay triangulation is performed over the initial set of nodes. Distances between every pair of the nodes in respective edges are calculated used as graph weights. The edges whose length exceeds the maximum edge length are removed. A minimum spanning tree is built over every disconnected graph. The minimum spanning trees covering a maximum of nodes are selected, among which the tree whose l

APA, Harvard, Vancouver, ISO, and other styles

46

Burdonov, Igor Borisovich. "Graph Self-Transformation Model Based on the Operation of Change the End of the Edge." Russian Digital Libraries Journal 23, no. 3 (2020): 315–35. http://dx.doi.org/10.26907/1562-5419-2020-23-3-315-335.

Full text

Abstract:

We consider a distributed network whose topology is described by an undirected graph. The network itself can change its topology, using special “commands” provided by its nodes. The work proposes an extremely local atomic transformation acb of a change the end c of the edge ac, “moving” along the edge cb from vertex c to vertex b. As a result of this operation, the edge ac is removed, and the edge ab is added. Such a transformation is performed by a “command” from a common vertex c of two adjacent edges ac and cb. It is shown that from any tree you can get any other tree with the same set of v

APA, Harvard, Vancouver, ISO, and other styles

47

Aji Sailendra, Alfi Istijap, Evawati Alisah, and Achmad Nasichuddin. "DEKOMPOSISI GRAF POHON PISANG Bm,n." Jurnal Riset Mahasiswa Matematika 2, no. 1 (2022): 25–31. http://dx.doi.org/10.18860/jrmm.v2i1.14671.

Full text

Abstract:

A decomposition of graph G is collection of subgraphs 〖{H_i}〗_(i=1)^n from G such that H_i [E_i] for E_i is a subset of E(G) and 〖{E_i}〗_(i=1)^n is a partition of E(G). The purpose of the research was to determine the decomposition of the banana tree graph B_(m,n), for m≥1 and n≥2. The research method used in this research is library research. The steps used to determine the decomposition of the banana tree graph B_(m,n) are as follow: (a) Draw a banana tree graph B_(m,n) and label each edge and vertex, (b) Determine the partition on the edges of the banana tree graph B_(m,n), (c) Induced subg

APA, Harvard, Vancouver, ISO, and other styles

48

Aji Sailendra, Alfi Istijap, Evawati Alisah, and Achmad Nasichuddin. "DEKOMPOSISI GRAF POHON PISANG Bm,n." Jurnal Riset Mahasiswa Matematika 2, no. 1 (2022): 322–28. http://dx.doi.org/10.18860/jrmm.v1i7.14671.

Full text

Abstract:

A decomposition of graph G is collection of subgraphs 〖{H_i}〗_(i=1)^n from G such that H_i [E_i] for E_i is a subset of E(G) and 〖{E_i}〗_(i=1)^n is a partition of E(G). The purpose of the research was to determine the decomposition of the banana tree graph B_(m,n), for m≥1 and n≥2. The research method used in this research is library research. The steps used to determine the decomposition of the banana tree graph B_(m,n) are as follow: (a) Draw a banana tree graph B_(m,n) and label each edge and vertex, (b) Determine the partition on the edges of the banana tree graph B_(m,n), (c) Induced subg

APA, Harvard, Vancouver, ISO, and other styles

49

Beasley, LeRoy B. "Linear preservers of tree partition numbers of graphs." Journal of Combinatorial Mathematics and Combinatorial Computing 125 (May 12, 2025): 445–52. https://doi.org/10.61091/jcmcc125-30.

Full text

Abstract:

Let\(G\) be an undirected graph. A tree partition of\(G\) is a set of trees whose edge sets are disjoint and whose union is the edge set of\(G\). The minimum cardinality of such a tree partition is called the tree partition number of\(G\). We show that for various types of trees allowed in the tree partition, that the only linear operators that preserve the tree partition number are vertex permutations.

APA, Harvard, Vancouver, ISO, and other styles

50

Afifah, Lilla, and I. Ketut Budayasa. "PELABELAN ANGGUN GRAF BERLIAN RANGKAP BERBINTANG, BEBERAPA KELAS GRAF POHON, DAN GRAF CORONA KHUSUS." MATHunesa: Jurnal Ilmiah Matematika 11, no. 3 (2023): 368–82. http://dx.doi.org/10.26740/mathunesa.v11n3.p368-382.

Full text

Abstract:

Pelabelan dari suatu graf adalah suatu pemetaan yang membawa setiap elemen graf yaitu himpunan sisi (edge) atau himpunan titik (vertex) ke bilangan bilangan bulat positif, yang disebut label. Sebuah fungsi disebut pelabelan anggun graf dengan m sisi jika adalah injektif dan fungsi terinduksi didefinisikan sebagai adalah bijektif. Graf yang mempunyai pelabelan anggun disebut graf anggun. Pada penelitian ini akan ditunjukkan konstruksi pelabelan anggun pada graf berlian rangkap berbintang , beberapa kelas graf pohon dan graf corona khusus (K_(n,n) ⨀ K_1). Kata kunci: Pelabelan anggun, graf

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!