Search
5 articles for “laplacian”
-
Intuitionistic Fuzzy Hypergraph Laplacians and Dominating Transversals for Resilient Discrete Network Design
Abstract: This manuscript develops a discrete mathematical framework for resilience analysis on networks whose interactions are polyadic, uncertain, and partially conflicting. Classical graphs compress multi-way coordination into pairwise edges, while ordinary fuzzy graphs often ignore the non-membership information that becomes critical in emergency logistics, infrastructure interdependence, and cyberphysical coordination. We therefore formulate an intuitionistic fuzzy hypergraph in which each vertex hyperedge incidence carries membership, non-membership, and hesitation, and we construct a …
Published in Research & Reviews: Discrete Mathematical Structures · Vol. 13, Issue 2, 2026 · pp. 15–21 Read article
-
Intrinsic Evaluation of Graph Embeddings: Assessing Clustering and Community Detection Performance
Abstract: This paper presents an intrinsic evaluation of some graph embedding techniques on clustering and community detection tasks. We analyze a diverse set of embedding methods, ranging from traditional techniques such as Laplacian eigenmaps to more recent approaches like graph autoencoders, high-order proximity preserved embedding (HOPE), and graph attention network (GAT), using two widely studied datasets, Cora and CiteSeer. Our evaluation relies on two main metrics: Silhouette score with respect to …
Published in International Journal of Algorithms Design and Analysis Review · Vol. 3, Issue 1, 2025 · pp. 40–48 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
-
T-π Network Simulation and Thevenin- Norton Equivalent Circuit Values From Laplace Description Using Pspice Software
Abstract: From the conversion methods of T-π (star-delta) for impedances circuits, the behavioral modeling of Pspice simulation program is used to obtain equivalent circuits using LAPLACE option. The conversions are verified for two types of circuits by obtaining AC values of voltages and currents at various nodes and branches using Pspice computer simulations. There are many ways of expressing Thevenin/Norton equivalent circuit parameters such as (a) as real numbers for pure …
Published in Journal of Semiconductor Devices and Circuits · Vol. 9, Issue 2, 2022 · pp. 43–58 Read article
-
Equivalent Linear Circuit for Thevenin and Norton Representation Using Superposition Theorem
Abstract: Using superposition theorem and knowing the Thevenin representation consisting of resistor, independent DC source of a network an equivalent DC network is obtained using SPICE software with linear circuit elements and independent sources and is verified. Also, similarly from the Norton representation, equivalent circuit is obtained. A procedure with Pspice methods to obtain unknown circuit elements using reciprocity theorem is described. Possible examples for (a) only resistive networks and (b) …
Published in Journal of Semiconductor Devices and Circuits · Vol. 10, Issue 2, 2024 · pp. 1–6 Read article