Results 41 to 50 of about 7,350,988 (308)
HARMONIC CENTRALIZATION OF SOME GRAPH FAMILIES
Advances and Applications in Discrete Mathematics, 2022 21 pages, 5 figures.
Jose Mari E. Ortega, Rolito G. Eballe
openaire +4 more sources
, 2009 For standard terminology and notion in graph theory we refer the reader to Harary [7]; the non-standard will be given in this paper as and when required.
Reddy, P. Siva Kota +3 more
core +1 more source
Discrete Mathematics, 1982 AbstractWe examine several graph equations involving the center, C(G), of a graph G. The central ratio of G, denoted c(G), is the ratio of |C(G)| to |V(G)|. We show that for any rational number r, where 0 < r ⩽ 1, there is a graph G with c(G) = r. For all such r, we describe a corresponding minimal graph.
openaire +1 more source
Triple Connected Domination Number of a Graph [PDF]
, 2012 The concept of triple connected graphs with real life application was introduced by considering the existence of a path containing any three vertices of a graph G.
Selvam Avadayappan +7 more
core +1 more source
Betweenness centrality in Cartesian product of graphs [PDF]
AKCE International Journal of Graphs and Combinatorics, 2017 Betweenness centrality is a widely-used measure in the analysis of large complex networks. It measures the potential or power of a vertex to control the communication over the network under the assumption that information primarily flows over the shortest paths between them.
Sunil Kumar R., Kannan Balakrishnan
openaire +4 more sources
Graph Algorithm Animation with Grrr [PDF]
, 2000 We discuss geometric positioning, highlighting of visited nodes and user defined highlighting that form the algorithm animation facilities in the Grrr graph rewriting programming language. The main purpose of animation was initially for the debugging and
Peter J. Rodgers +3 more
core +1 more source
Isolation Number of Transition Graphs
MathematicsLet G=(V,E) be a graph and F be a family of graphs; a subset (S⊆V(G)) is said to be an F-isolating set if G[V(G)∖NG[S]] does not contain F as a subgraph for all F∈F.
Junhao Qu, Shumin Zhang
doaj +1 more source
Graph-based implicit knowledge discovery from architecture change logs [PDF]
, 2012 Service architectures continuously evolve as a consequence of frequent business and technical change cycles. Architecture change log data represents a source of evolution-centric information in terms of intent, scope and operationalisation to ...
Pooyan Jamshidi (5276344) +12 more
core +2 more sources
Commuting Conjugacy Class Graph of The Finite $2-$Groups $G_n(m)$ and $G[n]$ [PDF]
Journal of Mahani Mathematical ResearchSuppose $G$ is a finite non-abelian group and $\Gamma(G)$ is a graph with non-central conjugacy classes of $G$ as its vertex set. Two vertices $L$ and $K$ in $\Gamma(G)$ are adjacent if there are $a \in L$ and $b \in K$ such that $ab = ba$.
Mohammad Ali Salahshour +1 more
doaj +1 more source
FEBS Letters, EarlyView.Enteropathogenic E. coli (EPEC) infects the human intestinal epithelium, resulting in severe illness and diarrhoea. In this study, we compared the infection of cancer‐derived cell lines with human organoid‐derived models of the small intestine. We observed a delayed in attachment, inflammation and cell death on primary cells, indicating that host ...
Mastura Neyazi +5 more
wiley +1 more source