Search
54 articles for “Connected graph”
-
Laceability in Line Graphs and Jump Graphs of Petersen Graph
Abstract: A simple connected graph is Hamiltonian laceable if there exists a Hamiltonian path between every pair of distinct vertices at an odd distance in it. is Hamiltonian-t-laceable (t*-laceable) if there exists a Hamiltonian path in between every pair (at least one pair) of vertices u and v in with the property Manjunath et al. obtained Hamiltonian laceability properties in line graphs and jump graphs of some graphs. In this paper …
Published in Research & Reviews: Discrete Mathematical Structures · Vol. 3, Issue 2, 2016 · pp. 5–13 Read article
-
A Review on Graphical Assembly Sequence Representation Methods and Their Advancements
Abstract: Representation of assembly sequence is significantly essential to describe many assembly attributes such as the connections between the components, sequence of the assembly operations, assembly trajectory constraints, assembly mating conditions, etc. Graphical or tree structure-based assembly sequence representation methods are most used in assembly sequence planning to obtain feasible assembly sequence, and to represent assembly attributes. Assembly sequence representation methodology carries an important role in assembly sequence planning and automation. …
Published in Journal of Mechatronics and Automation · Vol. 1, Issue 3, 2014 · pp. 56–66 Read article
-
Zagreb Degree Eccentricity Indices of Graphs
Abstract: AbstractLet G be a connected graph, the first Zagreb index M1(G) of G is defined as The second Zagreb index M2(G) of G is defined as In this paper we introduce first and second Zagreb degree eccentricity indices. Further, the first Zagreb degree eccentricity index of join, Cartesian product, tensor product, corona product of two graphs are computed. Keywords: Zagreb indices, Eccentricity, Degree, Zagreb degree eccentricity indices. Cite this ArticlePadmapriya …
Published in Research & Reviews: Discrete Mathematical Structures · Vol. 6, Issue 2, 2019 · pp. 59–69 Read article
-
Characterization of topologically 1-uniform dcsl graphs and learning graphs
Abstract: A distance compatible set labeling (dcsl) of a connected graph $G$ is an injective set assignment $f : V(G) \rightarrow 2^{X},$ $X$ being a non empty ground set, such that the corresponding induced function $f^{\oplus} :E(G) \rightarrow 2^{X}\setminus \{\phi\}$ given by $f^{\oplus}(uv)= f(u)\oplus f(v)$ satisfies $ |f^{\oplus}(uv)| = k_{(u,v)}^{f}d_{G}(u,v) $ for every pair of distinct vertices $u, v \in V(G),$ where $d_{G}(u,v)$ denotes the path distance between $u$ and $v$ …
Published in Research & Reviews: Discrete Mathematical Structures · Vol. 5, Issue 3, 2018 · pp. 6–10 Read article
-
On Graph Theory Based on Matrix
Abstract: This paper presents a new approach of graph theory based on natural numbers and matrix only. The natural number is used for vertex and matrix for the edge. The fast graph generation is an advantage of this approach by the successor function. The connected and non-connected graph both is defined by the axiom. There is the arithmetic based on the additive and multiplicative operation over the matrix with the set …
Published in Research & Reviews: Discrete Mathematical Structures · Vol. 9, Issue 1, 2022 · pp. 40–46 Read article
-
Edge Domination Number on Cartesian product of Simple Fuzzy Graphs
Abstract: AbstractIn this paper, we define the concept of edge domination number on Cartesian product of simple fuzzy graphs (G&H). Some results and bounds on edge domination number are derived in fuzzy graph (G×H). We prove some theorems that relate the parameters g(G×H), gcd(G×H) and g¢(G×H). Finally, the relationship between the fuzzy dominator chromatic number and edge domination number on Cartesian product of simple fuzzy graphs are discussed.Keywords: Dominating set, edge …
Published in Research & Reviews: Discrete Mathematical Structures · Vol. 4, Issue 1, 2017 · pp. 8–17 Read article
-
Articulation Point Technique in MANET
Abstract: The mobile ad hoc network, which is a wireless network of special type and has a collection of wireless hosts with wireless network interfaces, encompasses a temporary network, without any established infrastructure or centralized administration. All wireless nodes will start broadcasting again all the received broadcast messages. It is a common problem called as blind broadcast. Every node may receive the same copy of the messages from all the neighboring …
Published in Journal of Telecommunication, Switching Systems and Networks · Vol. 3, Issue 3, 2016 · pp. 25–34 Read article
-
Degree and Distance in 2-cartesian Product of Graphs
Abstract: The cartesian product of two graphs is well-known graph product and studied in detail. This concept has been generalized by introducing 2-cartesian product of graphs. The connectedness of 2-cartesian product of graphs has been discussed earlier. In this paper, first we obtain degree formula and discuss regularity of this product of graphs. Also, we have discuss distance between two vertices in this product.Cite this ArticleH.S. Mehta and U.P. Acharya. Degree …
Published in Research & Reviews: Discrete Mathematical Structures · Vol. 5, Issue 3, 2018 · pp. 11–14 Read article
-
Fast Recovery and Privacy Preservation against Global Eavesdropper in Ethernet Network
Abstract: Fast recovery from link failures is a well-studied topic in IP networks. Employing fast recovery in Ethernet networks is complicated as the forwarding is based on destination MAC addresses, which do not have the hierarchical nature similar to those exhibited in Layer 3 in the form of IP-prefixes. Moreover, switches employ backward learning to populate theforwarding table entries. Thus, any fast recovery mechanism in Ethernet networks must be based on …
Published in Journal of Advances in Shell Programming · Vol. 3, Issue 1, 2016 · pp. 12–18 Read article
-
Downhill Zagreb Polynomials of Graphs
Abstract: AbstractIn a number of applied and theoretical environments, graph polynomials and their roots have emerged. To deeply explore counting sequences connected to different graph parameters, graph polynomials have been introduced as generating polynomials. In addition, there has been a great deal of recent interest in graph polynomials. The first, second and forgotten downhill Zagreb indices are defined as and . In this paper, we define and study the first, second …
Published in Research & Reviews: Discrete Mathematical Structures · Vol. 7, Issue 3, 2020 · pp. 15–26 Read article
-
Applications of Depth-First Search
Abstract: AbstractIn this paper, various applications of depth-first search algorithms (DFS) are surveyed. The value of DFS or “Backtracking” as a technique for solving problem is illustrated by many applications such as cycle detection, strongly connected components, topological sort, and find articulation point in a graph. The time complexity in different applications of DFS is also summarized.Keywords: depth-first search, articulation point, strongly connected component, detecting cycle, graph, topological sort, railway rescheduling
Published in Journal of Computer Technology & Applications · Vol. 4, Issue 2, 2013 · pp. 1–9 Read article
-
Graph Sampling by Spanning Tree under Stratified Setup
Abstract: The sampling theory and its methodologies are based on assumption that the population under survey is of individuals and respondents have provided the answer of questions asked. When population is of graphical structure like containing nodes and edge links then it is complicated to apply the usual sampling procedures. Spanning tree is specified type of a graph, which is always connected with all nodes and becomes a sub-graph. Assume that …
Published in Research & Reviews : Journal of Statistics · Vol. 5, Issue 2, 2016 · pp. 11–31 Read article
-
Mixture Probability with Rayleigh Model and Application in Reliability
Abstract: Single Rayleigh distribution (RD) is a unimodal two tailed probability distribution. It is useful for the data which spreads equally to the two sides of its modal value. Some properties of the Rayleigh distribution have been discussed in this paper. Mixture distributions arise in engineering, economics, sciences, biosciences, medical sciences and play vital role. While modeling a great variety of data, a mixture model has been defined (investigated) with mixture …
Published in Research & Reviews : Journal of Statistics · Vol. 7, Issue 3, 2018 · pp. 17–27 Read article
-
Estimation of Edge in Population of Binary Tree Using Stratified Sampling Procedure
Abstract: Sampling methodologies is a tool to investigate about the information of unknown population parameters. Sometimes the population has the tree structure where one node has two or many paths to scatter. For example, from one airport, there are many routes to travel to different airports; and further, other airports have many similar links. This creates graphical structure of connectivity among different airports around the world. Now the problem of investigation …
Published in Research & Reviews : Journal of Statistics · Vol. 7, Issue 1, 2018 · pp. 60–73 Read article
-
Region Segmentation and Annotation with Vehicle Detection Validation Application in Airborne Images
Abstract: In this work, the authors propose an automatic image segmentation and annotation system for airborne images. Initial region segmentation using existing region segmentation methods is applied to airborne images first. To deal with over-segmentation on the initial region segmentation results, the authors performed graph-based region merging by constructing an undirected-graph based on 8-connected local neighborhood. For each region, the authors extracted low-level features and used the Support Vector Machine (SVM) …
Published in Journal of Image Processing & Pattern Recognition Progress · Vol. 1, Issue 1, 2014 · pp. 9–19 Read article
-
Characterizing the Existence of P4
Abstract: In a graph G = (V, E) P4 denotes a path of length 4 vertices <v1, v2, v3, v4> such that there is no edge between either <v1, v3> or <v2, v4>. This exists either in graph G = (V, E) or its complement or both for which both G and the complement Gc are connected. In this article we give a proof for this property.
Published in Research & Reviews: Discrete Mathematical Structures · Vol. 1, Issue 3, 2014 · pp. 39–41 Read article
-
Spectral Intuitionistic Fuzzy Hypergraph Operators and Dominance Kernels for Resilient Discrete Network Design
Abstract: A new discrete-mathematical framework is developed for resilient network design on intuitionistic fuzzy hypergraphs, where uncertainty is explicitly represented through membership, non-membership, and hesitation degrees associated with both vertices and hyperedges. These three components are systematically integrated into an effective incidence operator that captures the underlying uncertain relationships within complex hypergraph structures. Based on this operator, both un-normalised and normalized Laplacian matrices are formulated to characterize the spectral properties and …
Published in Recent Trends in Mathematics · Vol. 3, Issue 2, 2026 · pp. 41–48 Read article
-
Layered Metal–Polymer Hybrid Laminates with Embedded Impact Sensors for Connected Automotive Panels
Abstract: The increasing demand for lightweight, intelligent, and structurally reliable automotive components has accelerated the development of multifunctional hybrid materials capable of simultaneously providing superior mechanical performance and real-time structural health monitoring. In this study, a novel layered metal–polymer hybrid laminate incorporating an embedded flexible impact sensor was developed for connected automotive panel applications. The laminate was fabricated using AA6061-T6 aluminum alloy face sheets and a thermoplastic polyurethane interlayer through hot-press …
Published in Journal of Polymer & Composites · Vol. 14, Issue 5, 2026 · pp. 36–47 Read article
-
Comparative Analysis of the Model of DVB-T Model Using Various Modulation Techniques 16 QAM & 64 QAM for the Primary Colors
Abstract: Computerized TV broadcasting is the spirit without bounds transmission. Progressions in advanced innovation, pressure in sound and video flagging and other flag handling systems' improvement lead to qualitative change in the field of digital/computerized TV. Usage of a coaxial link and through satellite and earthbound way, computerized transmission is made conceivable. Digitized TV would execute the convolution coding plan alongside OFDM adjustment strategy. The pressure is done and afterward the …
Published in Recent Trends in Electronics Communication Systems Read article
-
Comparative Analysis of the Model of DVB-T Model Using Various Modulation Techniques 16 QAM & 64 QAM for the Primary Colors
Abstract: Computerized TV broadcasting is the spirit without bounds transmission. Progressions in advanced innovation, pressure in sound and video flagging and other flag handling systems' improvement lead to qualitative change in the field of digital/computerized TV. Usage of a coaxial link and through satellite and earthbound way, computerized transmission is made conceivable. Digitized TV would execute the convolution coding plan alongside OFDM adjustment strategy. The pressure is done and afterward the …
Published in Recent Trends in Electronics Communication Systems · Vol. 8, Issue 3, 2021 · pp. 7–16 Read article