Mathews Journal of Case Reports Hydranencephaly Mohammad Nawaz Nasery1, Farhad Farzam1, Hidayatullah Hamidi2, Jamshid Sadiqi2, Ahmad Reshad Faizi2, Fazel Rahman Faizi2, Marzia Mohammadi2 1Radiology department, Ali Abad Teaching Hospital, Kabul, Afghanistan. 2Radiology department, French Medical Institute for Children (FMIC), Kabul, Afghanistan. Corresponding Author: Mohammad Nawaz Nasery, Ali A...

Favaron et al. (1991) have obtained a proof of a conjecture of Fajtlowicz’ computer program Graffiti that for every graph G the number of zeroes left after fully reducing the degree sequence as in the Havel-Hakimi Theorem is at most the independence number of G. In this paper we present a simplified version of the proof of Graffiti’s conjecture, and we find how the residue relates to a natural ...

Nasser Shakhssalim1, Mohammad Samzadeh2 and Seyed Mohammad Ghahestani3 1Assistant Professor of Urology, Urology and Nephrology Research Center (UNRC), Shahid Labbafinejad Medical Center, Shahid Beheshti University of Medical Sciences (SBUMS), Tehran, 2Resident of Urology, UNRC, Shahid Labbafinejad Medical Center,SBUMS, Tehran, 3Fellowship of Pediatric Urology Tehran university of medical scienc...

Much of the Internet economy relies on online advertising for monetizing digital content: Users are expected to accept the presence of online advertisements in exchange for content being free. However, online advertisements have become a serious problem for many Internet users: while some are merely annoyed by the incessant display of distracting ads cluttering Web pages, others are highly conc...

The degree profile of an edge e of a finite hypergraph H is the map assigning to a positive integer i the number of vertices of degree i incident with e. The edge degree profile of H is the map describing for any possible degree profile ~ the number of edges in H with degree profile ~. A necessary and sufficient condition for existence of hypergraphs of prescribed edge degree profile is found. ...

One of the simplest ways to decide whether a given finite sequence of positive integers can arise as the degree sequence of a simple graph is the greedy algorithm of Havel and Hakimi. This note extends their approach to directed graphs. It also studies cases of some simple forbidden edge-sets. Finally, it proves a result which is useful to design an MCMC algorithm to find random realizations of...