
A graph
A graph with
A handicap distance antimagic labeling of a graph
We construct regular handicap distance antimagic graphs for every feasible odd order.
A well-known subclass of chordal graphs is formed by proper interval graphs. Due to their very special structural properties, several problems proved hard to solve for interval graphs can have better solutions for this subclass. In this paper, we address the recognition problem, proposing an update of one of the first existing linear algorithms. The outcome is a simple and efficient algorithm. In addition, we present a certifying algorithm for the recognition of proper interval graphs
A bipartite graph on
A vertex set
A Hamiltonian graph
In a red-blue coloring of a graph
For a graph
For a connected graph
This paper investigates vertex colorings of graphs such that some rainbow subgraph
Let
Recording actual user interactions with a system is often useful for testing software applications. User-session based test suites that contain records of such interactions often find a complementary set of faults compared to test suites created by testers. This work utilizes such test suites and presents a new prioritization method that extends the existing combinatorial two-way inter-window prioritization by introducing weights on the distance between windows. We examine how a window distance between a pair of the parameter-value tuples influences the fault detection effectiveness. We evaluate several approaches used to calculate weights. Results show improvement over the original two-way inter-window prioritization technique, while the comparison of different weighting approaches reveals that a negative linear weighting calculation generally performs better in our experiments. The study demonstrates that the distance between windows in a pair is an important factor to consider in test suite prioritization, and that distinguishing windows by their order in a test case also improves the fault detection rate compared to using window labels that were utilized in previous methods. This work provides motivation for future work to develop general n-way combinatorial distance-based prioritization methods that take into account space and processing time requirements to address potential issues with large test suites.
In this paper, we identify
For a connected graph
A cancellable number (CN) is a fraction in which a decimal digit can be removed (“cancelled”) in the numerator and denominator without changing the value of the number; examples include
A
Given nonnegative integers
1970-2025 CP (Manitoba, Canada) unless otherwise stated.