267 Results Found

A graph is unipolar if it can be partitioned into a clique and a disjoint union of cliques, and a graph is a generalised split graph if it or its complement is unipolar. A unipolar partition of a graph can be used to find efficiently the clique numbe...

It is a well-known fact that a graph of diameter d has at least $d+1$ eigenvalues. A graph is d-extremal (resp. $d_{\alpha }$-extremal) if it has diameter d and exactly $d+1$ distinct eigenvalues (resp. $\alpha$-eigenvalues), and a graph is split if its vertex...

Background/Objectives: Predicting blood–brain barrier (BBB) permeability from structure remains challenging. We evaluated whether graph neural networks (GNNs) improve experimental logBB prediction over descriptor-based machine learning and whet...

Consider a graph G which belongs to a graph class $\mathcal{C}$. We are interested in connecting a node $w\notin V\left(G\right)$ to G by a single edge $uw$ where $u\in V\left(G\right)$; we call such an edge a tail. As the graph resulting from G after the addition of the tail, denoted $G+$...

Efficient deployment of neural-network detectors on field-programmable gate array (FPGA) accelerators depends not only on model complexity but also on compiler-visible graph structure. On deep learning processing unit (DPU) platforms, unsupported ope...

The Hamiltonian cycle reconfiguration problem asks, given two Hamiltonian cycles $C_0$ and $C_t$ of a graph G, whether there is a sequence of Hamiltonian cycles $C_0,C_1,\dots ,C_t$ such that $C_i$ can be obtaine...

In this study, a novel concept of picture fuzzy threshold graph (PFTG) is introduced. It has been shown that PFTGs are free from alternating 4-cycle and it can be constructed by repeatedly adding a dominating or an isolated node. Several properties a...

A domination coloring of a graph G is a proper vertex coloring of G, such that each vertex of G dominates at least one color class (possibly its own class), and each color class is dominated by at least one vertex. The minimum number of colors among...

Overlapping clustering is a fundamental and widely studied subject that identifies all densely connected groups of vertices and separates them from other vertices in complex networks. However, most conventional algorithms extract modules directly fro...

Unsupervised learning often relies on non-negative matrix factorization (NMF) for extracting low-dimensional features. Standard deep NMF models, however, tend to miss complex hierarchical patterns and may warp the intrinsic geometry of high-dimension...

We show that there is a relationship between the generalized Euler characteristic ${\mathcal{E}}_o\left(\right|V_{D_o}\left|\right)$ of the original graph that was split at vertices into two disconnected subgraphs $i=1,2$ and their generalized Euler characteristics ${\mathcal{E}}_i\left(\right|V_{D_i}\left|\right)$. Here, $|V_{D_o}|$ and...

In 5G and beyond 5G networks, function placement is a crucial strategy for enhancing the flexibility and efficiency of the Radio Access Network (RAN). However, demonstrating optimal function splitting and placement to meet diverse user demands remain...

This paper proposes an algorithm named EddyGraph for tracking mesoscale eddy splitting and merging events. Twenty-seven years (January 1993–December 2019) of sea level anomaly (SLA) data are analyzed in the Northwest Pacific Ocean (105°E–165°W, 0°N–6...

We consider the interactions of traveling localized wave solutions with a vertex in a star graph domain that describes multiple Josephson junctions with a common/branch point (i.e., tricrystal junctions). The system is modeled by the sine-Gordon equa...

Weak magnetic flux leak detection is one of the most important non-destructive testing and measurement methods for pipelines. Since different defects cause different damage, it is necessary to classify the different types of defects. Traditional mach...

Graph Neural Networks (GNNs) have achieved strong performance on graph-structured data via neighborhood message passing. Recent studies on GNNs suggest that not all feature dimensions benefit equally from message passing, motivating preference-guided...

Let G be a simple connected graph. In this paper, we study the spectral properties of the generalized distance matrix of graphs, the convex combination of the symmetric distance matrix $D\left(G\right)$ and diagonal matrix of the vertex transmissions ...

Weather monitoring systems, such as Doppler radars, collect a high volume of measurements with fine spatial and temporal resolutions that provide opportunities to study many convective weather events. This study examines the spatial and temporal char...

The use of molecular markers with inadequate variation levels has resulted in poorly resolved phylogenetic relationships within Ilex. Focusing on southern South American and Asian species, we aimed at contributing informative plastid markers. Also, w...

We extend the theory of splits in finite metric spaces to infinite ones. Within this more general framework, we investigate the class of spaces having metrics that are integer-valued and totally split-decomposable, as well as the polyhedral complex s...

Text that accumulates over time does not only drift: topics are born, they die, they fragment into competing sub-narratives (splits), and they fuse into broader frames (merges). Our companion system paper, BERTilda, detects these events with transpar...

This paper studies the maximum-clique independence problem and some variations of the clique transversal problem such as the $\left\{k\right\}$-clique, maximum-clique, minus clique, signed clique, and k-fold clique transversal problems from algorithmic aspects for...

Experimentally observed complex networks are often scale-free, small-world and have an unexpectedly large number of small cycles. An Apollonian network is one notable example of a model network simultaneously having all three of these properties. Thi...

Accurate road graph extraction from satellite imagery is essential for large-scale mapping and geospatial analysis. Recent one-shot graph extraction frameworks based on foundation models have achieved promising performance, but their effectiveness de...

The graph connectivity is a fundamental concept in graph theory. In particular, it plays a vital role in applications related to the modern interconnection graphs, e.g., it can be used to measure the vulnerability of the corresponding graph, and is a...

This research article examines the co-intersection graph of a commutative ring $\mathrm{𝒮}$. The co-intersection graph $\Omega \left(\mathrm{𝒮}\right)$ is defined as a simple graph where the vertices correspond to the non-trivial ideals of $\mathrm{𝒮}$, and two distinct...

Image-based structural damage assessment requires automated methods that respect physical constraints. We formulate graph-neural-network message passing as a pseudo-time iteration of a monotone operator on a spatial-region graph. Under non-negative p...

Let $L\left(K_n\right)$ be the line graph of $K_n$ and let ${\mathrm{HS}}_6$ be the graph obtained from a 4-cycle by attaching a pendant edge at each of two antipodal vertices. We prove that $L\left(K_n\right)$ has an ${\mathrm{HS}}_6$-decomposition if and only if $n\ge 4$ and $n\not\equiv 3(mod4)$. The proof splits...

We discuss a connection between the generalized Euler characteristic ${\mathcal{E}}_o\left(\right|V_{D_o}\left|\right)$ of the original graph which was split at edges into two separate subgraphs and their generalized Euler characteristics ${\mathcal{E}}_i\left(\right|V_{D_i}\left|\right)$, $i=1,2$, where $|V_{D_o}|$ and $|V_{D_i}|$ are the numb...

At present, with the explosive growth of data scale, subgraph matching for massive graph data is difficult to satisfy with efficiency. Meanwhile, the graph index used in existing subgraph matching algorithm is difficult to update and maintain when fa...

Perfect Roman Dominating Functions and Unique Response Roman Dominating Functions are two ways to translate perfect code into the framework of Roman Dominating Functions. We also consider the enumeration of minimal Perfect Roman Dominating Functions...

With the rapid growth in the penetration rate of mobile devices and the surge in demand for mobile data services, small cells and mobile backhaul networks have become the critical focus of next-generation mobile network development. Backhaul requirem...

A 3-connected graph is minimally 3-connected if removal of any edge destroys 3-connectivity. We present an algorithm for constructing minimally 3-connected graphs based on the results in (Dawes, JCTB 40, 159-168, 1986) using two operations: adding an...

This paper provides a formal proof of the conjecture stating that optimal colorings in max k-cut games over unweighted and undirected graphs do not allow the formation of any strongly divergent coalition, i.e., a subset of nodes able to increase thei...

A total k-rainbow dominating function on a graph $G=(V,E)$ is a function $f:V\left(G\right)\to 2^{\{1,2,\dots ,k\}}$ such that (i) ${\cup }_{u\in N\left(v\right)}f\left(u\right)=\{1,2,\dots ,k\}$ for every vertex v with $f\left(v\right)=\varnothing$, (ii) ${\cup }_{u\in N\left(v\right)}f\left(u\right)\ne \varnothing$ for $f\left(v\right)\ne \varnothing$. T...

Whole-slide image (WSI) classification in veterinary computational pathology usually freezes a human-pretrained pathology foundation model as the tile encoder and trains a light slide-level aggregator on top. Whether the choice of aggregator matters...

Attack graph modeling aims to generate attack models by investigating attack behaviors recorded in intrusion alerts raised in network security devices. Attack models can help network security administrators discover an attack strategy that intruders...

Graph Convolutional Networks (GCNs) are widely used for graph-structured data, but graph pre-training still lacks simple structural objectives that can be applied when semantic annotations are unavailable. This paper proposes GTAP (Graph Topology-Awa...

Ventilation network feature graphs (Q-H graphs) are a key visualisation tool for mine ventilation systems, and their automated generation reduces to a combinatorial optimisation problem over independent-path permutations. Existing methods, however, e...

Existing whole-body human pose estimation methods mostly segment the parts of the body’s hands and feet for specific processing, which not only splits the overall semantics of the body, but also increases the amount of calculation and the compl...

Wi-Fi stations (STAs) repeatedly scan channels to maintain access-point information, but a conventional full Wi-Fi scan incurs substantial delay and energy overhead. SplitScan mitigates this cost by allowing neighboring STAs to exchange reports throu...

Accurate differentiation of malignant from benign thyroid nodules on ultrasound remains challenging and existing deep models typically operate on isolated ROI crops or whole images, ignoring structured peri-lesional context. We present a simple, repr...

Graph neural networks are often applied to load forecasting on the assumption that electrically related meter points should be modeled jointly, but this is rarely tested against a graph-free control, and building the graph usually requires a network...

This paper presents a fault diagnosis method for a vacuum contactor using the generalized Stockwell transform (GST) of vibration signals. The objective is to solve the problem of low diagnostic performance efficiency caused by the inadequate feature...

We study sequential adaptation from rumor detection on PHEME, where reply structure is observed, to harmful-content flagging on USE24-XD, a 2024–2025 corpus released without propagation structure. A gated network fuses a BERTweet representation...

A bijective product k-cordial labeling f of a graph G with vertex set V and edge set E is a bijection from V to $\{1,2,\dots ,|V|\}$ such that the induced edge labeling $f^{\times }:E\left(G\right)\to {\mathbb{Z}}_k=\{i|0\le i\le k-1\}$ defined as $f^{\times }\left(uv\right)\equiv f\left(u\right)f(v$...

In cybersecurity, constructing an accurate knowledge graph is vital for discovering key entities and relationships in security incidents buried in vast unstructured threat reports. Traditional knowledge-graph construction pipelines based on handcraft...

Virtual learning environments log time-stamped learner–platform events, from which a soft sensor can estimate course outcomes early. A leakage-audited protocol synchronizes all channels at 20%, 40%, or 60% landmarks, excludes already-withdrawn...

Interdisciplinary scientific project evaluation requires reviewer selection that is both accurate and explainable; however, rapidly changing topics and heterogeneous terminology make it difficult to match experts. This study develops and evaluates an...

Software vulnerability mining is important for improving software reliability and security. Compared with sequence-based models, graph neural networks (GNNs) can explicitly model program structures such as syntax, control flow, data flow, call relati...