Results 71 to 80 of about 116,552 (326)

Reducing Rank of the Adjacency Matrix by Graph Modification

Theoretical Computer Science, 2015
The main topic of this article is to study a class of graph modification problems. A typical graph modification problem takes as input a graph G, a positive integer k and the objective is to add/delete k vertices (edges) so that the resulting graph belongs to a particular family, \(\mathcal F\), of graphs.
S.M. Meesum, Pranabendu Misra, Saket Saurabh   +2 more
openaire   +3 more sources

Vertex colouring using the adjacency matrix [PDF]

Journal of Physics: Conference Series, 2019
Recently, graph theory is one of the most rapidly developing sciences. Graphs in its applications are generally used to represent discrete objects and relationships between these objects. The visual representation of a graph is to declare an object as a vertex, while the relationship between objects is expressed as an edge. One topic in graph theory is
Ika Hesti Agustin, Ridho Alfarisi, Dafik, Kiswara Agung Santoso, R. M. Prihandini   +4 more
openaire   +1 more source

Unveiling unique protein and phosphorylation signatures in lung adenocarcinomas with and without ALK, EGFR, and KRAS genetic alterations

Molecular Oncology, EarlyView.
Proteomic and phosphoproteomic analyses were performed on lung adenocarcinoma (LUAD) tumors with EGFR, KRAS, or EML4–ALK alterations and wild‐type cases. Distinct protein expression and phosphorylation patterns were identified, especially in EGFR‐mutated tumors. Key altered pathways included vesicle transport and RNA splicing.
Fanni Bugyi, Mirjam Balbisi, Simon Sugár, Lóránd Váncza, Eszter Regős, Ilona Kovalszky, Ibolya Laczó, Tünde Harkó, Gábor Kecskeméti, Zoltán Szabó, Judit Moldvay, László Drahos, Lilla Turiák   +12 more
wiley   +1 more source

On the second minimizing graph in the set of complements of trees

AKCE International Journal of Graphs and Combinatorics, 2019
Let G be a graph of order n and A(G)=[ai,j]be its adjacency matrix such that ai,j=1 if viis adjacent to vjand ai,j=0 otherwise, where 1≤i,j≤n. In a certain family of graphs, a graph is called minimizing (or second minimizing) if the least eigenvalue of ...
M. Javaid
doaj   +1 more source

Hierarchical data structures for flowchart

Scientific Reports, 2023
Flowcharts have broad applications in the fields of software development, engineering design, and scientific experimentation. Current flowchart data structure is mainly based on the adjacency list, cross-linked list, and adjacency matrix of the graph ...
Peng Zhang, Wenzhang Dou, Huaping Liu
doaj   +1 more source

On the Inverse of Forward Adjacency Matrix

, 2017
During routine state space circuit analysis of an arbitrarily connected set of nodes representing a lossless LC network, a matrix was formed that was observed to implicitly capture connectivity of the nodes in a graph similar to the conventional incidence matrix, but in a slightly different manner. This matrix has only 0, 1 or -1 as its elements.
Mukherjee, Pritam, Satish, L.
openaire   +2 more sources

Role of Adjacency Matrix & Adjacency List in Graph Theory

INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY, 2012
Today, graph theory has become major instrument that is used in an array of fields. Some of these include electrical engineering, mathematical research, sociology, economics, computer programming/networking, business administration and marketing. Indeed, many problems can be modeled with paths formed by traveling along the edges of a certain graph ...
Richa Sharma, Harmanjit Singh
openaire   +3 more sources

Modeling hepatic fibrosis in TP53 knockout iPSC‐derived human liver organoids

Molecular Oncology, EarlyView.
This study developed iPSC‐derived human liver organoids with TP53 gene knockout to model human liver fibrosis. These organoids showed elevated myofibroblast activation, early disease markers, and advanced fibrotic hallmarks. The use of profibrotic differentiation medium further amplified the fibrotic signature seen in the organoids.
Mustafa Karabicici, Soheil Akbari, Ceyda Caliskan, Canan Celiker, Ozden Oz, Leman Binokay, Gökhan Karakulah, Serif Senturk, Esra Erdal   +8 more
wiley   +1 more source

Determinantal properties of Boolean graphs using recursive approach

AKCE International Journal of Graphs and Combinatorics
The aim of this paper is to study the determinant and inverse of the adjacency matrices of weighted and directed versions of Boolean graphs. Our approach is recursive. We describe the adjacency matrix of a weighted Boolean graph in terms of the adjacency
Gahininath Sonawane, Ganesh S. Kadu, Y. M. Borse   +2 more
doaj   +1 more source

Patient‐specific pharmacogenomics demonstrates xCT as predictive therapeutic target in colon cancer with possible implications in tumor connectivity

Molecular Oncology, EarlyView.
This study integrates transcriptomic profiling of matched tumor and healthy tissues from 32 colorectal cancer patients with functional validation in patient‐derived organoids, revealing dysregulated metabolic programs driven by overexpressed xCT (SLC7A11) and SLC3A2, identifying an oncogenic cystine/glutamate transporter signature linked to ...
Marco Strecker, Keren Zohar, Martin Böttcher, Thomas Wartmann, Henry Freudenstein, Maximilian Doelling, Mihailo Andric, Wenjie Shi, Or Kakhlon, Katrin Hippe, Beatrix Jahnke, Dimitrios Mougiakakos, Franziska Baenke, Daniel Stange, Roland S. Croner, Michal Linial, Ulf D. Kahlert   +16 more
wiley   +1 more source