[PDF] Top 20 Signed (b,k) Edge Covers in Graphs
Has 10000 "Signed (b,k) Edge Covers in Graphs" found on our website. Below are the top 20 most common "Signed (b,k) Edge Covers in Graphs".
Signed (b,k) Edge Covers in Graphs
... We consider a variant of the standard edge cover problem. Let G be a graph with vertex set and edge set . We use [6] for terminology and notation which are not defined here and consider only simple ... See full document
6
On Cyclic Orthogonal Double Covers of Circulant Graphs by Certain Graphs
... Then the edges of length 2 are {π(π₯ 4 ), π(π₯ 1 )} and {π(π₯ 1 ), π(π₯ 2 )} ; those of length 2 are {π(π₯ 0 ), π(π₯ 3 )} and {π(π’ 1 ), π(π₯ 0 )} ; the edge of length π are {π(π₯ 2 ), π(π₯ 3 )} ; those of length π where {3 ... See full document
8
Dot-Line Signed Graphs
... each edge is a clique of S ...a signed graph H = ( U , F , ΞΎ ) and an ECC Q of H such that (i) Q =: K S , the set of maximal cliques (or maxcliques) of ... See full document
7
General Cyclic Orthogonal Double Covers of Finite Regular Circulant Graphs
... an edge { v v 1 , 2 } in Circ n d d ( ; { 1 , 2 , ο , d k } ) , the length of { v v 1 , 2 } is min { v 1 β v 2 , n β v 1 β v 2 } ...d k } ) , the rotation dis- tance r l ( ) between e 1 and e 2 is r ... See full document
9
Resistance Distance and Kirchhoff Index of Two Edge-subdivision Corona Graphs
... the edge-subdivision-vertex corona and edge-subdivision-edge corona in terms of the group inverse of the factor ...these graphs can be derived from the resistance distance and Kirchhoff index ... See full document
7
Restricted Connectivity of Cartesian Product Graphs
... undirected graphs with no loops or multiple ...simple graphs. Let G be a graph with vertex set V (G) and edge set E(G), and S be a non-empty subset of V (G), then S is a vertex-cut if G β S is ... See full document
6
Optimal Constituent Alignment with Edge Covers for Semantic Projection
... bipartite graphs can be computed effi- ciently in cubic time using algorithms for net- work optimisation (Fredman and Tarjan, 1987; time O(|U s | 2 log | U s |+|U s | 2 |U t |)) or algorithms ... See full document
8
Discrepancy and signed domination in graphs and hypergraphs
... In this paper, we present new upper and lower bounds for the signed domination number, which improve the above theorems and also generalise three known results formulated in Corol- laries 4, 5 and 6. Note that our ... See full document
12
Wheel Related Some Signed Product Cordial Graphs
... We begin with simple, finite, undirected graph = ( ( ), ( )), where ( ) and ( ) are the vertex set and the edge set respectively. For all other terminology we follow Gross 1 . For latest survey of graph labeling ... See full document
7
On certain topological indices of signed graphs
... A signed graph (see [22, 23]), denoted by S(G, Ο), is a graph G(V, E) together with a function Ο : E(G) β {+,β} that assigns a sign, either + or β, to each ordinary edge in ...the signed graph ... See full document
14
Isolated signed dominating function of graphs
... Throughout this paper, we consider only finite, simple and undirected graphs. The set of vertices and edges of a graph G(p, q) will be denoted by V (G) and E (G) respectively, p = |V (G)| and q = |E(G)|. For graph ... See full document
5
Domination and Signed Domination Number of Cayley Graphs
... In this section p is a prime number and B(1, n) = {k < n : gcd(k, n) = 1}. Lemma 2.1. Let G be a group and H be a proper subgroup of G such that [G : H ] = t. If S = G \ H , then Cay(G : S) is a ... See full document
8
Signed and Signed Product Cordial Labeling of Cylinder Graphs and Banana Tree
... We begin with finite, connected and undirected graph πΊ = π πΊ , πΈ πΊ without loops and multiple edges. Graph labelings of diverse types are currently the subject of much study. Most graph labeling methods trace their ... See full document
8
Pseudo Complete Color Critical Graphs
... called k-edge critical ifΟ (G)= k and Ο (G β e) <k, for every edge e E ...called k- vertex critical if Ο (G) = k and Ο (G β v) < for every vertex v of ...called ... See full document
8
On Corona Product of Two Fuzzy Graphs
... fuzzy graphs in 1975 ...fuzzy graphs were defined by Moderson and Peng ...fuzzy graphs which are obtained from two given fuzzy graphs using these operations were discussed by Nagoorgani and ... See full document
6
On Thorny Fuzzy Graphs
... fuzzy graphs in 1975 ...fuzzy graphs were defined by Moderson and Peng ...fuzzy graphs which are obtained from two given fuzzy graphs using these operations were discussed by Nagoorgani and ... See full document
5
More Equienergetic Signed Graphs
... a signed graph G s and W = V (G s ) \ W . Let G 0s be the signed graph obtained from G s by changing the positive edges to negative edges and negative edges to positive edges between W and W ...Two ... See full document
11
The $ k $-${\rm \bf{ th}}$ spectral moment of signed complete graphs
... Let G = (V (G), E(G)) be a simple graph with the vertex set V (G) and the edge set E(G) where |E(G)| β₯ 1. The order of G is defined to be |V (G)| and if the degree of a vertex u of G is 1, then u is called a ... See full document
10
Signed Edge Total Domination on Rooted Product Graphs
... Graph theory is one of the important branch in mathematics. Its applications are many like Engineering communications, Computer networking and etc. The rooted product graphs are usually used in internet networking ... See full document
5
Remarks on the Complexity of Signed k Domination on Graphs
... the signed k-domination problem and dedicated to the complexity of the problem on ...integer k, we show that the signed k-domination problem is NP-complete for doubly chordal ...chordal ... See full document
6
Related subjects