Results 81 to 90 of about 587,547 (217)

On the 2-token graph of a graph

AKCE International Journal of Graphs and Combinatorics, 2020
Let be a graph and let be a positive integer. Let = and . The -token graph is the graph with vertex set and two vertices and are adjacent if and , where denotes the symmetric difference. In this paper we present several basic results on 2-token graphs.
J. Deepalakshmi, G. Marimuthu, A. Somasundaram, S. Arumugam   +3 more
doaj   +1 more source

The Feasibility Test of Electric Propulsion Systems: Case Study for a Light and Fixed‐Wing Aircraft

Energy Science &Engineering, EarlyView.
ABSTRACT This study investigates the feasibility and performance of a fully electric propulsion system (EPS) integrated into a light fixed‐wing aircraft. The system consists of a 65 kW‐class electric motor, a high‐efficiency inverter, and dual lithium‐ion battery packs with a total capacity of 27 kWh—collectively engineered to fulfill both power ...
Byeong Gyu Gang
wiley   +1 more source

Dissecting the angiogenic mechanism of pachychoroid polypoidal choroidal vasculopathy

iMeta, EarlyView.
A prognosis‐oriented classification system was established to distinguish Pachy PCV from Non‐pachy PCV using a large multicenter dataset. Comparative plasma multi‐omics profiling of Pachy PCV, Non‐pachy PCV, and normal controls revealed unique upregulation of the fluid shear stress and atherosclerosis (FSS‐AS) and HIF‐1 signaling pathways in Pachy PCV.
Xinyu Zhao, Tiantian Cheng, Wenfei Zhang, Xingwang Gu, Qing Zhao, Yaning Chen, Lihui Meng, Jiaqi Zhang, Bintao Qiu, Lili Li, Shiyu Cheng, Zicheng Wang, Chuting Wang, Yuelin Wang, Zuyi Yang, Zhengming Shi, Ye Guo, Shengzhi Liu, Youxin Chen   +18 more
wiley   +1 more source

Maximal outerplanar graphs as chordal graphs, path-neighborhood graphs, and triangle graphs [PDF]

Maximal outerplanar graphs are characterized using three different classes of graphs. A path-neighborhood graph is a connected graph in which every neighborhood induces a path. The triangle graph $T(G)$ has the triangles of the graph $G$ as its vertices,
Novick, B., Laskar, R.C., Mulder, H.M.
core  

Explicit 3‐colorings for Exponential Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT In 1985, El‐Zahar and Sauer showed that the chromatic number of the direct product of two 4‐chromatic graphs is 4, establishing a nontrivial case of Hedetniemi's conjecture, which has since been refuted in general. Their proof uses the concept of an exponential graph, showing that if a graph H $H$ has no proper 3‐coloring, then the exponential
Adrien Argento, Pierre Charbit, Alantha Newman   +2 more
wiley   +1 more source

Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem

Journal of Graph Algorithms and Applications, 2011
Spanning tree congestion is a relatively new graph parameter, which has been studied intensively. This paper studies the complexity of the problem to determine the spanning tree congestion for non-sparse graph classes, while it was investigated for some ...
Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno   +3 more
doaj   +1 more source

Chordal probe graphs [PDF]

, 2004
In this paper, we introduce the class of chordal probe graphs which are a generalization of both interval probe graphs and chordal graphs. A graph G is chordal probe if its vertices can be partitioned into two sets P (probes) and N (non-probes) where N ...
Lipshteyn, Marina, Golumbic, Martin Charles   +1 more
core   +1 more source

Characterization of Graphs Without Even F $F$‐Orientations

Journal of Graph Theory, EarlyView.
ABSTRACT A graph G $G$ is 1‐extendable if every edge belongs to at least one 1‐factor of G $G$. Let G $G$ be a graph with a 1‐factor F $F$. Then an even (odd) F $F$ ‐orientation of G $G$ is an orientation in which each F $F$‐alternating cycle has exactly an even (odd) number of edges directed in the same fixed direction around the cycle.
Marién Abreu, Domenico Labbate, Federico Romaniello, John Sheehan   +3 more
wiley   +1 more source

The Leafage Of A Chordal Graph [PDF]

, 1998
The leafage l(G) of a chordal graph G is the minimum number of leaves of a tree in which G has an intersection representation by subtrees. We obtain upper and lower bounds on l(G) and compute it on special classes.
West, Douglas, Douglas B. West, In-jen Lin, McKee, Terry, Terry A. Mckee, Lin, In-Jen   +5 more
core  

Characterization of Super Strongly Perfect Graphs in Chordal and Strongly Chordal Graphs [PDF]

, 2012
A Graph G is Super Strongly Perfect Graph if every induced sub graph H of G possesses a minimal dominating set that meets all the maximal complete sub graphs of H.
Amutha, A, Jeya Jothi, R Mary
core   +1 more source