Results 41 to 50 of about 652,005 (320)
Splitting Edge Partitions of Graphs
Mathematica Pannonica, 2023 In a typical maximum clique search algorithm when optimality testing is inconclusive a forking takes place. The instance is divided into smaller ones. This is the branching step of the procedure. In order to ensure a balanced work load for the processors for parallel algorithms it is essential that the resulting smaller problems are do not overly vary ...
Király, Balázs, Szabó, Sándor
openaire +1 more source
Classical simulation of quantum many-body systems with a tree tensor network [PDF]
, 2006 We show how to efficiently simulate a quantum many-body system with tree structure when its entanglement is bounded for any bipartite split along an edge of the tree.
A. J. Daley +5 more
core +2 more sources
Mapana - Journal of Sciences, 2010 For a graph G, let G, L(G), J(G) S(G), L,(G) and M(G) denote Complement, Line graph, Jump graph, Splitting graph, Line splitting graph and Middle graph respectively. In this paper, we solve the graph equations L(G) =S(H), M(G) = S(H), L(G) = LS(H), M(G) =LS(H), J(G) = S(H), M(G) = S(H), J(G) = LS(H) and M(G) = LS(G).
B. Basavanagoud, Veena Mathad
openaire +2 more sources
Split Legendary Domination in graphs
Ratio MathematicaHarary and Norman introduced the line graph L(G) . We introduced the legendary domination number by combining the domination concept both in graph and its line graph.
P. Kavitha
doaj +1 more source
Universal graphs and universal permutations
, 2013 Let $X$ be a family of graphs and $X_n$ the set of $n$-vertex graphs in $X$. A graph $U^{(n)}$ containing all graphs from $X_n$ as induced subgraphs is called $n$-universal for $X$.
Atminas, Aistis +3 more
core +1 more source
On fully split lacunary polynomials in finite fields [PDF]
, 2011 We estimate the number of possible types degree patterns of $k$-lacunary polynomials of degree $t < p$ which split completely modulo $p$. The result is based on a combination of a bound on the number of zeros of lacunary polynomials with some graph ...
Bibak, Khodakhast, Shparlinski, Igor E.
core +1 more source
Electronic Notes in Discrete Mathematics, 2008 Abstract A split graph is a graph whose vertex set admits a partition into a stable set and a clique. The chromatic indexes for some subsets of split graphs, such as split graphs with odd maximum degree and split-indifference graphs, are known. However, for the general class, the problem remains unsolved.
S. M. ALMEIDA +2 more
openaire +3 more sources
Radio labeling of biconvex split graphs
AKCE International Journal of Graphs and CombinatoricsA radio labeling of a graph G is a function [Formula: see text] such that for every pair of distinct vertices [Formula: see text], where diam(G) denotes the diameter of the graph and d(u, v) is the distance between the vertices u and v.
G. Sethuraman, M. Nithya
doaj +1 more source
Monadic second-order definable graph orderings [PDF]
, 2014 We study the question of whether, for a given class of finite graphs, one can define, for each graph of the class, a linear ordering in monadic second-order logic, possibly with the help of monadic parameters.
Blumensath, Achim, Courcelle, Bruno
core +3 more sources
Characterizations for split graphs and unbalanced split graphs
, 2021 We introduce a characterization for split graphs by using edge contraction. Then, we use it to prove that any ($2K_{2}$, claw)-free graph with $α(G) \geq 3$ is a split graph. Also, we apply it to characterize any pseudo-split graph. Finally, by using edge contraction again, we characterize unbalanced split graphs which we use to characterize the ...
openaire +2 more sources