نتایج جستجو برای: complete product split graph

تعداد نتایج: 845551  

2007
Pierre Hansen Hadrien Mélot Dragan Stevanović

We give characterizations of integral graphs in the family of complete split graphs and a few related families of graphs.

2017
Andrea Pasquali

Article history: Received 8 July 2015 Received in revised form 22 February 2016 Available online 4 August 2016 Communicated by S. Koenig We investigate how the higher almost split sequences over a tensor product of algebras are related to those over each factor. Herschend and Iyama give in [6] a criterion for when the tensor product of an n-representation finite algebra and an m-representation ...

2014
Flavia Bonomo Guillermo Duran Mario Valencia-Pabon

We consider the following vertex-partition problem on graphs: given a graph with real nonnegative edge weights, partition the vertices into clusters (i.e. cliques) to minimize the total weight of edges out of the clusters. This optimization problem is known to be an NP-complete problem even for unweighted graphs and has been studied extensively in the scope of fixed-parameter tractability (FPT)...

Journal: :Australasian J. Combinatorics 2015
Jason Hedetniemi

Unique minimum dominating sets in the Cartesian product of a graph and a Hamming graph are considered. A characterization of such sets is given, when they exist. A necessary and sufficient condition for the existence of a unique minimum dominating set is given in the special case of the Cartesian product of a tree and multiple copies of the same complete graph.

Journal: :Barekeng 2023

Rainbow vertex-connection number is the minimum colors assignment to vertices of graph, such that each vertex connected by a path whose edges have distinct and denoted . The rainbow connection can be applied graphs resulting from operations. One methods create new graph perform operations between two graphs. Thus, this research uses comb product operation determine rainbow-vertex cycle complete...

Journal: :Eur. J. Comb. 2013
Tinaz Ekim Pinar Heggernes Daniel Meister

Polar graphs generalise bipartite graphs, cobipartite graphs, and split graphs, and they constitute a special type of matrix partitions. A graph is polar if its vertex set can be partitioned into two, such that one part induces a complete multipartite graph and the other part induces a disjoint union of complete graphs. Deciding whether a given arbitrary graph is polar, is an NP-complete proble...

Journal: :Discussiones Mathematicae Graph Theory 2015
Jason Hedetniemi

Unique minimum vertex dominating sets in the Cartesian product of a graph with a complete graph are considered. We first give properties of such sets when they exist. We then show that when the first factor of the product is a tree, consideration of the tree alone is sufficient to determine if the product has a unique minimum dominating set.

Journal: :Discrete Mathematics & Theoretical Computer Science 2017
Arman Boyaci Tinaz Ekim Mordechai Shalom Shmuel Zaks

The families EPT (resp. EPG) Edge Intersection Graphs of Paths in a tree (resp. in a grid) are well studied graph classes. Recently we introduced the graph classes Edge-Intersecting and Non-Splitting Paths in a Tree (ENPT), and in a Grid (ENPG). It was shown that ENPG contains an infinite hierarchy of subclasses that are obtained by restricting the number of bends in the paths. Motivated by thi...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید