Entity usage

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

Showing below up to 50 results in range #51 to #100.

A note on Hamiltonian cycles in planar graphs: Label: en
Partially balanced incomplete block (PBIB)-designs associated with geodetic sets in graphs: Label: en
The Tutte polynomial of a class of compound graphs and its applications: Label: en
Total outer connected vertex-edge domination: Label: en
Topological indices of the wreath product of graphs: Label: en
Minimum constraint removal problem for line segments is NP-hard: Label: en
Eccentric connectivity coindex of bipartite graphs: Label: en
On 3-degree 4-chordal graphs: Label: en
2-Point set domination in separable graphs: Label: en
On k-cost effective domination in the corona and lexicographic product of graphs and its variant: Label: en
Decomposition dimension of Cartesian product of some graphs: Label: en
Nordhaus–Gaddum problem in terms of G-free coloring: Label: en
2-Trees: Structural insights and the study of Hamiltonian paths: Label: en
Quasi-Laplacian energy of composite graphs: Label: en
On connected co-independent domination in the join, corona and lexicographic product of graphs: Label: en
Reachability problems in interval-constrained and cardinality-constrained graphs: Label: en
Primality, criticality and minimality problems in trees: Label: en
Connectivity of superpower graphs of some non-abelian finite groups: Label: en
General Randić index of trees with given number of branching vertices: Label: en
The Seidel spectrum of two variants of join operations: Label: en
The extended graph of a module over a commutative ring: Label: en
LCD matrix product codes with an application: Label: en
Cyclic longest common subsequence: Label: en
Hamming distance between the strings generated by adjacency matrix of a subgraph complementary graph and their sum: Label: en
Average degree matrix and average degree energy: Label: en
The size multipartite Ramsey numbers mj(C3,C3,nK2,mK2): Label: en
Some results on majority bad number: Label: en
An instance-based algorithm for deciding the bias of a coin: Label: en
Complexity aspects of restrained Roman domination in graphs: Label: en
Minimal instances with no weakly stable matching for three-sided problem with cyclic incomplete preferences: Label: en
Linear recurrent cryptography: Golden-like cryptography for higher order linear recurrences: Label: en
The adjacency spectrum and metric dimension of an induced subgraph of comaximal graph of ℤn: Label: en
Maximum independent sets in a proper monograph determined through a signature: Label: en
Complete classification of cyclic codes of length 3ps over 𝔽pm + u𝔽pm + u2𝔽pm: Label: en
On the chromatic number of (P5,dart)-free graphs: Label: en
An extended study of k-restricted edge connectivity: Another approach to Tait’s coloring theorem: Label: en
On weak metric dimension of digraphs: Label: en
Spectrum of corona products based on splitting graphs: Label: en
Computing vertex resolvability of some regular planar graphs: Label: en
Outer independent double Italian domination: Complexity, characterization: Label: en
The restrained double geodetic number of a graph: Label: en
Local irregular vertex coloring of comb product by path graph and star graph: Label: en
Maximum max-k-clique subgraphs in cactus subtree graphs: Label: en
An extension of binary cyclotomic sequences having order 2lt: Label: en
Twin prime difference set and its application on a coded mask: Label: en
Spectral analysis of weighted neighborhood networks: Label: en
Bounds for the decomposition dimension of some class of graphs: Label: en
On the variants of first KCD energy: Label: en
k-Efficient domination: Algorithmic perspective: Label: en
On a spanning subgraph of the annihilating-ideal graph of a commutative ring: Label: en