Results 61 to 70 of about 206,170 (167)
Social Structure Decomposition With Security Issue
Social structure decomposition has been a valuable research topic in the study of social networks, and it still has many unresolved problems. At the same time, an increasing number of people pays attention to the security issue that is worth considering ...
Wenshun Teng +3 more
doaj +1 more source
Computing Some Topological Indices of Two Kinds of Dendrimer Graphs Gn and Hn
Dendrimer molecules are macromolecules which have many applications in nanosciences, drug delivery, biology, and different areas of sciences. Topological indices of chemical graph theory are numerical descriptor of a molecular structure.
Hojat Kaviani, Lotfallah Pourfaraj
doaj +1 more source
A New Type-2 Soft Set: Type-2 Soft Graphs and Their Applications
The correspondence between a vertex and its neighbors has an essential role in the structure of a graph. Type-2 soft sets are also based on the correspondence of primary parameters and underlying parameters.
Khizar Hayat +3 more
doaj +1 more source
Edge Irregular Reflexive Labeling for the Disjoint Union of Gear Graphs and Prism Graphs
In graph theory, a graph is given names—generally a whole number—to edges, vertices, or both in a chart. Formally, given a graph G = ( V , E ) , a vertex naming is a capacity from V to an arrangement of marks.
Xiujun Zhang +3 more
doaj +1 more source
Spectral characterizations of sun graphs and broken sun graphs [PDF]
Several matrices can be associated to a graph such as the adjacency matrix or the Laplacian matrix. The spectrum of these matrices gives some informations about the structure of the graph and the question ''Which graphs are determined by their spectrum?''
Romain Boulet
doaj +1 more source
-labeling of supersubdivided connected graph plus an edge
Rosa, in his classical paper (Rosa, 1967) introduced a hierarchical series of labelings called and labeling as a tool to settle Ringel’s Conjecture which states that if is any tree with edges then the complete graph can be decomposed into copies of ...
G. Sethuraman, M. Sujasree
doaj +1 more source
Small Complete Minors Above the Extremal Edge Density [PDF]
A fundamental result of Mader from 1972 asserts that a graph of high average degree contains a highly connected subgraph with roughly the same average degree. We prove a lemma showing that one can strengthen Mader's result by replacing the notion of high
Shapira, Asaf, Sudakov, Benny
core
Graphs with Large Disjunctive Total Domination Number
Let $G$ be a graph with no isolated vertex. In this paper, we study a parameter that is a relaxation of arguably the most important domination parameter, namely the total domination number, $\gamma_t(G)$.
Henning, Michael A., Naicker, Viroshan
core +2 more sources
“Follow the Leader”: A Centrality Guided Clustering and Its Application to Social Network Analysis
Within graph theory and network analysis, centrality of a vertex measures the relative importance of a vertex within a graph. The centrality plays key role in network analysis and has been widely studied using different methods.
Qin Wu +3 more
doaj +1 more source
Limits of Ordered Graphs and their Applications
The emerging theory of graph limits exhibits an analytic perspective on graphs, showing that many important concepts and tools in graph theory and its applications can be described more naturally (and sometimes proved more easily) in analytic language ...
Ben-Eliezer, Omri +3 more
core

