- Research Article
9
- 10.1016/j.dam.2017.10.021
Some problems on induced subgraphs
- Nov 13, 2017
- Discrete Applied Mathematics
- Vaidy Sivaraman
Some problems on induced subgraphs
The structural information contentIg(X) of a graphX was treated in detail in three previous papers (Mowshowitz 1968a, 1968b, 1968c). Those investigations ofIg point up the desirability of defining and examining other entropy-like measures on graphs. To this end the chromatic information contentIc(X)of a graphX is defined as the minimum entropy over all finite probability schemes constructed from chromatic decompositions having rank equal to the chromatic number ofX. Graph-theoretic results concerning chromatic number are used to establish basic properties ofIc on arbitrary graphs. Moreover, the behavior ofIc on certain special classes of graphs is examined. The peculiar structural characteristics of a graph on which the respective behaviors of the entropy-like measuresIc andIg depend are also discussed.
Some problems on induced subgraphs
Some problems on induced subgraphs
On Adjacent Vertex-Distinguishing Total Chromatic Number of Generalized Petersen Graphs
Analyzing chromatic number in coloring problem is a tough topic in graph analysis. We focus on the basic theory for a particular type of chromatic number. This will give us insights on the basic topological structure guiding lots of networks in the coming trend of big data era. An adjacent vertex-distinguishing total k-coloring is a proper total k-coloring of a graph G such that for any two adjacent vertices, the set of colors appearing on the vertex and its incident edges are different. The smallest k for which such a coloring of G exists is called the adjacent vertex-distinguishing total chromatic number, and denoted by ?at(G). It has been proved that if the graph G satisfies ?(G)=3, then ?at(G)= 6. However, it is very difficult to determine whether ?at(G)= 5. In this paper, we focus on a special class of 3-regular graphs, the generalized Petersen graphs P(n, k), and show that ?at(P(n, k)) = 5, which improves the bound ?at (P(n, k))= 6.
Read moreAn Algorithmic Solution for the “Hair Ball” Problem in Data Visualization
The investigation and analysis of large and complex graphs is an important aspect of data visualization research, yet there is a need for entirely new, scalable approaches and methodologies for graph visualization. This can ultimately provide more insight into the structure and function of this complex graph (Hair Ball). To explain more, we need to find a methodology to develop a solution to present a “Tidy” graph with the minimal crossover between edges in the “Hair Balls.” In spite of the expanding significance of investigating and extensively analyzing and understanding very large graphs of data, the traditional way of visualizing graphs has difficulties scaling up, and typically ends up depicting these large graphs as “Hair Balls”. This traditional approach does indeed have a deeply intuitive foundation: nodes are depicted with a shape such as a circle, triangle or square, which are then connected by lines or curves that represent the edges. In any case, although there are many different ways to apply this basic underlying idea, it needs to be revisited in light of current and emerging needs for understanding increasingly complex crossover between edges in the graphs. The complex “Hair Ball,” which appears as an indecipherable graph, came from the crossover between edges. From our preliminary research, we found the major disadvantage in the Hair Balls graph was that it confused observers. Users may think there are some extra nodes; but in reality, there are not. Because there are many crossovers between edges in the Hair Balls, the impression also may affect observers’ understanding of the whole structure of the graph. Major problem-no effective reception of information from a “Hair Balls” graph-meaningless to observers.
Read moreGraceful Local Antimagic Labeling of Graphs: A Pattern Analysis Using Python
Graph labeling is the process of assigning labels to vertices and edges under certain conditions. This paper investigates the graceful local antimagic labeling of various graph families, excluding symmetric labelings, using computational experiments and Python-based algorithms. Through these experiments, we identify new results and patterns within specific graph classes. The study expands on the existing literature by offering computational evidence, proposing algorithms for the verification of labelings, and exploring the relationship between the local antimagic labeling and the chromatic number. Our results increase the understanding of graph labeling and offer insights into its computational aspects.
Read moreComplexity of the Operation Graphs on Cycle and Complete Graph
The number of spanning trees (or complexity) of a graph can be used to measure the reliabilities of network and circuit design. Although many NP hard problems are related to the complexity of graphs, there are explicit formulas for the complexity of some specific graph classes. This paper mainly studies the explicit expression of the complexity of graphs obtained by graph operations. Through classical graph operations, we obtain some operation graphs generated by cycle and complete graph, and get the closed formulas for the complexity in these operation graphs. Compared with Daoud’s results, we obtain some interesting algebraic properties about the complexity of operation graphs.
Read moreInjective Coloring Parameters of Some Special Classes of Graphs
The vertex coloring of a graph can be viewed as a random experiment and with respect to this experiment, a random variable can be defined such that denotes the color of an arbitrarily chosen vertex. In this paper, we broaden the ideas of coloring mean and variance of graphs with respect to a particular type of proper injective coloring and determine these parameters for some standard graph classes. MSC2010: 05C15, 05C38. Keywords : Coloring mean; coloring variance; -chromatic mean; -chromatic variance; -chromatic mean; -chromatic variance. Cite this Article V. Santhosh Priya, N.K. Sudev . Injective Coloring Parameters of Some Special Classes of Graphs. Discrete Mathematical Structures . 2019; 6(2): 30–40p.
Read moreChromatic numbers of subgraphs
Given an arbitrary graph, wh~t can we say about the setl of all chromatic numbers of its subgraphs ? In particular, for e~rdinals m ~ n, does every graph of chromatic number m have a subgraph of chromatic number n? For n ~ ~t 0 the affirmative answer follows from the theorem of DE BI~UIJ~ and ERD6S [1], SO the simplest nontrivial question is whether every graph of chromatic number ~2 has a subgraph of chromatic number Nr I have no positive results; the purpose of this note is only to state the probleml in the form of 2 dubious conjectures, and to prove that the stronger conjecture implies a weak form of the GCH. If % is a set, [S] 2 = {X c~ S " [X l = 2}. We regard a graph as a system G = (V, E) consisting of a set V of vertices and a set E ~c [ V] ~ of edges. A coloring of G is a function f defined on V such thatf(x) :~f(y) whenever {x, y} # E. G is m-colorable if there is a coloring f such that If(V) l ~ m. The chromatic number of G, ehr(G), is the least m such that G is m-eolorable. A graph G" ---- (V', E') is a vertex subgraph of G if V' ~ V and E' = E N [V'~]; an edge subgraph if V' ~ V and E' c E. ConJEcturE 1. For m ~ n, every graph of chromatic number m has a vertex subgraph of chromatic number n.
Read moreAxiom of choice and chromatic number of [formula omitted
Axiom of choice and chromatic number of [formula omitted
HOLES AND DOMINOES IN MEYNIEL GRAPHS
Many practical problems (frequency assignement, register allocation, timetables) may be formulated as graph (vertex-)coloring problems, but finding solutions for them is difficult as long as they are treated in the most general case (where the graph is arbitrary), since vertex coloring has been proved to be NP-complete. The problem becomes much easier to solve if the graph resulting from the modelisation of the practical application belongs to some particular class of graphs, for which solutions to the problem are known. Meyniel graphs form such a class (a fast coloring algorithm can be found in [9]), for which an efficient recognizing algorithm is therefore needed. A graph G=(V,E) is said to be a Meyniel graph if every odd cycle of G on at least five vertices contains at least two chords. Meyniel graphs generalize both i-triangulated and parity graphs, two well known classes of perfect graphs that will be present in our paper in Section 7. In [2], Burlet and Fonlupt propose a characterization of Meyniel graphs which relies on the following property: the class of Meyniel graphs may be obtained from some basic Meyniel graphs using a binary operation called amalgam. Besides the theoretical interest of this result, a practical interest arises because of the polynomial recognition algorithm which can be obtained. Unfortunately, it is quite expensive to verify if a given graph is the amalgam of two graphs (therefore the complexity of the whole algorithm is in O(n7)), and this supports the idea that a new point of view is needed to find a more efficient algorithm. Our approach of Meyniel graphs will be directed through the search of a general structure. Intuitively, a Meyniel graph either will be simple (i.e. with no hole or domino), or will have a skeleton around which the rest of the graph will be regularly organized. As suggested, the first type of Meyniel graphs is simple to identify. For the second type, a deeper analysis is necessary; it yields a characterization theorem, which is used to deduce the O(m2+mn) recognition algorithm.
Read moreOn Structural Parameterizations of Load Coloring
Given a graph G and a positive integer k, the 2-Load Coloring problem is to check whether there is a 2-coloring \(f:V(G) \rightarrow \{r,b\}\) of G such that for every \(i \in \{r,b\}\), there are at least k edges with both end vertices colored i. It is known that the problem is \(\mathsf {NP} \)-complete even on special classes of graphs like regular graphs. Gutin and Jones (Inf Process Lett 114:446-449, 2014) showed that the problem is fixed-parameter tractable by giving a kernel with at most 7k vertices. Barbero et al. (Algorithmica 79:211-229, 2017) obtained a kernel with less than 4k vertices and O(k) edges, improving the earlier result.In this paper, we study the parameterized complexity of the problem with respect to structural graph parameters. We show that 2-Load Coloring cannot be solved in time \(f(w)n^{o(w)}\), unless ETH fails and it can be solved in time \(n^{O(w)}\), where n is the size of the input graph, w is the clique-width of the graph and f is an arbitrary function of w. Next, we consider the parameters distance to cluster graphs, distance to co-cluster graphs and distance to threshold graphs, which are weaker than the parameter clique-width and show that the problem is fixed-parameter tractable (FPT) with respect to these parameters. Finally, we show that 2-Load Coloring is \(\mathsf {NP} \)-complete even on bipartite graphs and split graphs.
Read morePolar graphs and maximal independent sets
Polar graphs and maximal independent sets
Matching graphs with unique node labels
A special class of graphs is introduced in this paper. The graphs belonging to this class are characterised by the existence of unique node labels. A number of matching algorithms for graphs with unique node labels are developed. It is shown that problems such as graph isomorphism, subgraph isomorphism, maximum common subgraph (MCS) and graph edit distance (GED) have a computational complexity that is only quadratic in the number of nodes. Moreover, computing the median of a set of graphs is only linear in the cardinality of the set. In a series of experiments, it is demonstrated that the proposed algorithms run very fast in practice. The considered class makes the matching of large graphs, consisting of thousands of nodes, computationally tractable. We also discuss an application of the considered class of graphs and related matching algorithms to the classification and detection of abnormal events in computer networks.
Read moreGraphs
This chapter describes the history of graphs and introduces the main definitions of graphs. It discusses some particular classes of graphs that we can meet in philosophy and provides some examples of them. The chapter presents a list of well-known graphs that we can put together according to their name. A graph generally has different kinds of drawings, but all of these are isomorphic. So, a graph is in fact a class of graphs generally defined up to an isomorphism. Even when graphs are non-separable, they always admit subgraphs. Informally speaking, the reconstruction conjecture says that graphs are determined uniquely by their subgraphs. The conjecture has been verified for a number of infinite classes of graphs: regular graphs, trees, disconnected graphs, unit interval graphs, separable graphs without end vertices, maximal planar graphs, maximal outerplanar graphs, outerplanar graphs and critical blocks.
Read moreThe adjacency dimension of graphs
It is known that the problem of computing the adjacency dimension of a graph is NP-hard. This suggests finding the adjacency dimension for special classes of graphs or obtaining good bounds on this invariant. In this work we obtain general bounds on the adjacency dimension of a graph G in terms of known parameters of G . We discuss the tightness of these bounds and, for some particular classes of graphs, we obtain closed formulae. In particular, we show the close relationships that exist between the adjacency dimension and other parameters, like the domination number, the location-domination number, the 2 -domination number, the independent 2 -domination number, the vertex cover number, the independence number and the super domination number.
Read moreEditorial Board Submissions Current Issue Issue in Progress Volumes & Issues Degree-Based and Neighborhood Degree Sum-Based Entropy Measures of Molnupiravir
An entirely novel virus that causes severe acute respiratory syndrome began to spread around the world at the end of 2019. Since there are no curative treatments to treat the viral infection, efforts are being made globally to stop the coronavirus from spreading. The coronavirus strain is also known as 2019-nCoV and officially identified as SARS-CoV-2 (severe acute respiratory syndrome coronavirus 2). Several distinctive characteristics of graphs have been used to differentiate the construction of entropy-based measurements from the structure of chemical graphs. Graph entropies have emerged as the information-theoretic quantities for quantifying the fundamental information of chemical graphs. The prospective applicability of the graph entropy measure in discrete mathematics, biology and chemistry has drawn attention from the scientific community. In this work, we study the structural properties of one of the known antiviral drugs, Molnupiravir, and introduce the concept of entropy measure for this drug. We evaluate the degree-based and neighborhood degree sum-based entropy by considering the values of topological indices of the chemical compound. Furthermore, we present the graphical representations of these entropy measures. A comparative analysis of degree-based and neighborhood degree sum-based topological indices, along with their associated entropy measures, is presented for Molnupiravir through graphical illustrations using numerical data.
Read more